./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 648a34748ee6f317001c61f0628c2e00b2100c77ff87e7d85b52ec2f91d6d096 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:52,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:52,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:52,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:52,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:52,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:52,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:52,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:52,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:52,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:52,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:52,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:52,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:52,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:52,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:52,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:52,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:52,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:52,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:52,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:52,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:52,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:52,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:52,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:52,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:52,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:52,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:52,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:52,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:52,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:52,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:52,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:52,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:52,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:52,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:52,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:52,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:52,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:52,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:52,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:52,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:52,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:28:52,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:52,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:52,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:52,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:52,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:52,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:52,317 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:52,318 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:52,318 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:52,318 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:52,319 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:52,319 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:52,319 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:52,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:52,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:52,320 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:52,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:52,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:52,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:52,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:52,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:52,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:52,321 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:52,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:52,322 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:52,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:52,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:52,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:52,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:52,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:52,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:52,324 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:52,324 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 648a34748ee6f317001c61f0628c2e00b2100c77ff87e7d85b52ec2f91d6d096 [2022-02-21 04:28:52,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:52,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:52,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:52,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:52,542 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:52,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:52,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d29cc84/6263e152de3c4774972f0608e7794361/FLAG34fdb799e [2022-02-21 04:28:53,006 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:53,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:53,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d29cc84/6263e152de3c4774972f0608e7794361/FLAG34fdb799e [2022-02-21 04:28:53,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d29cc84/6263e152de3c4774972f0608e7794361 [2022-02-21 04:28:53,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:53,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:53,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:53,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:53,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:53,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18480d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53, skipping insertion in model container [2022-02-21 04:28:53,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:53,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:53,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c[16824,16837] [2022-02-21 04:28:53,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:53,370 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:53,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c[16824,16837] [2022-02-21 04:28:53,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:53,445 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:53,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53 WrapperNode [2022-02-21 04:28:53,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:53,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:53,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:53,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:53,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,524 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 434 [2022-02-21 04:28:53,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:53,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:53,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:53,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:53,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:53,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:53,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:53,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:53,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (1/1) ... [2022-02-21 04:28:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:53,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:28:53,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:53,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:53,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:53,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:53,724 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:53,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:54,204 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:54,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:54,211 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:54,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:54 BoogieIcfgContainer [2022-02-21 04:28:54,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:54,214 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:54,214 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:54,217 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:54,218 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:54,218 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:53" (1/3) ... [2022-02-21 04:28:54,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14586fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:54, skipping insertion in model container [2022-02-21 04:28:54,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:54,219 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:53" (2/3) ... [2022-02-21 04:28:54,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14586fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:54, skipping insertion in model container [2022-02-21 04:28:54,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:54,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:54" (3/3) ... [2022-02-21 04:28:54,221 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:54,263 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:54,263 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:54,263 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:54,263 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:54,263 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:54,264 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:54,264 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:54,264 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:54,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 141 states, 140 states have (on average 1.7142857142857142) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 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 04:28:54,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2022-02-21 04:28:54,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:54,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:54,359 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:54,359 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:54,359 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:54,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 141 states, 140 states have (on average 1.7142857142857142) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 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 04:28:54,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2022-02-21 04:28:54,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:54,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:54,377 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:54,377 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:54,384 INFO L791 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 38#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 122#L285true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 55#L285-1true init_#res#1 := init_~tmp~0#1; 99#L450true main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 41#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 104#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 109#L526-2true [2022-02-21 04:28:54,390 INFO L793 eck$LassoCheckResult]: Loop: 109#L526-2true assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 126#L84true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 100#L88true assume !(node1_~m1~0#1 != ~nomsg~0); 124#L88-1true ~mode1~0 := 0; 24#L84-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 29#L116true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 130#L119true assume !(node2_~m2~0#1 != ~nomsg~0); 28#L119-1true ~mode2~0 := 0; 121#L116-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 106#L150true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 9#L153true assume !(node3_~m3~0#1 != ~nomsg~0); 89#L153-1true ~mode3~0 := 0; 93#L150-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 86#L184true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 132#L187true assume !(node4_~m4~0#1 != ~nomsg~0); 108#L187-1true ~mode4~0 := 0; 80#L184-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 39#L218true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 91#L221true assume !(node5_~m5~0#1 != ~nomsg~0); 56#L221-1true ~mode5~0 := 0; 14#L218-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 52#L252true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 19#L255true assume !(node6_~m6~0#1 != ~nomsg~0); 35#L255-1true ~mode6~0 := 0; 141#L252-2true assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 112#L458true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 137#L458-1true check_#res#1 := check_~tmp~1#1; 113#L470true main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 45#L559true assume !(0 == assert_~arg#1 % 256); 143#L554true assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; 109#L526-2true [2022-02-21 04:28:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2022-02-21 04:28:54,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:54,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857615681] [2022-02-21 04:28:54,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:54,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:54,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {145#true} is VALID [2022-02-21 04:28:54,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {145#true} is VALID [2022-02-21 04:28:54,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {145#true} is VALID [2022-02-21 04:28:54,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {145#true} init_#res#1 := init_~tmp~0#1; {145#true} is VALID [2022-02-21 04:28:54,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {145#true} main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {145#true} is VALID [2022-02-21 04:28:54,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {146#false} is VALID [2022-02-21 04:28:54,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {146#false} is VALID [2022-02-21 04:28:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:54,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:54,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857615681] [2022-02-21 04:28:54,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857615681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:54,581 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:54,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:28:54,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657175511] [2022-02-21 04:28:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:54,587 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 959479027, now seen corresponding path program 1 times [2022-02-21 04:28:54,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:54,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688443702] [2022-02-21 04:28:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:54,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume !(node1_~m1~0#1 != ~nomsg~0); {147#true} is VALID [2022-02-21 04:28:54,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {147#true} ~mode1~0 := 0; {147#true} is VALID [2022-02-21 04:28:54,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {147#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#true} assume !(node2_~m2~0#1 != ~nomsg~0); {147#true} is VALID [2022-02-21 04:28:54,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {147#true} ~mode2~0 := 0; {147#true} is VALID [2022-02-21 04:28:54,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {147#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {147#true} assume !(node3_~m3~0#1 != ~nomsg~0); {147#true} is VALID [2022-02-21 04:28:54,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#true} ~mode3~0 := 0; {147#true} is VALID [2022-02-21 04:28:54,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {147#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {147#true} assume !(node4_~m4~0#1 != ~nomsg~0); {147#true} is VALID [2022-02-21 04:28:54,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {147#true} ~mode4~0 := 0; {147#true} is VALID [2022-02-21 04:28:54,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {147#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {147#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {147#true} assume !(node5_~m5~0#1 != ~nomsg~0); {147#true} is VALID [2022-02-21 04:28:54,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {147#true} ~mode5~0 := 0; {147#true} is VALID [2022-02-21 04:28:54,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {147#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {147#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {147#true} is VALID [2022-02-21 04:28:54,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {147#true} assume !(node6_~m6~0#1 != ~nomsg~0); {147#true} is VALID [2022-02-21 04:28:54,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {147#true} ~mode6~0 := 0; {147#true} is VALID [2022-02-21 04:28:54,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {147#true} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {147#true} is VALID [2022-02-21 04:28:54,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {147#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {149#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:54,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {149#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {150#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:54,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {150#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {151#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:28:54,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {151#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {148#false} is VALID [2022-02-21 04:28:54,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {148#false} assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; {148#false} is VALID [2022-02-21 04:28:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:54,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:54,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688443702] [2022-02-21 04:28:54,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688443702] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:54,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:54,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:54,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197766900] [2022-02-21 04:28:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:54,857 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:54,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:54,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 04:28:54,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 04:28:54,891 INFO L87 Difference]: Start difference. First operand has 141 states, 140 states have (on average 1.7142857142857142) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 04:28:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:55,023 INFO L93 Difference]: Finished difference Result 141 states and 237 transitions. [2022-02-21 04:28:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:55,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 04:28:55,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:55,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 237 transitions. [2022-02-21 04:28:55,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2022-02-21 04:28:55,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 136 states and 232 transitions. [2022-02-21 04:28:55,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2022-02-21 04:28:55,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-02-21 04:28:55,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 232 transitions. [2022-02-21 04:28:55,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:55,072 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2022-02-21 04:28:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 232 transitions. [2022-02-21 04:28:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-02-21 04:28:55,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:55,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states and 232 transitions. Second operand has 136 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 135 states have internal predecessors, (232), 0 states have call successors, (0), 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 04:28:55,111 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states and 232 transitions. Second operand has 136 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 135 states have internal predecessors, (232), 0 states have call successors, (0), 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 04:28:55,113 INFO L87 Difference]: Start difference. First operand 136 states and 232 transitions. Second operand has 136 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 135 states have internal predecessors, (232), 0 states have call successors, (0), 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 04:28:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:55,124 INFO L93 Difference]: Finished difference Result 136 states and 232 transitions. [2022-02-21 04:28:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 232 transitions. [2022-02-21 04:28:55,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:55,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:55,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 135 states have internal predecessors, (232), 0 states have call successors, (0), 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 136 states and 232 transitions. [2022-02-21 04:28:55,127 INFO L87 Difference]: Start difference. First operand has 136 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 135 states have internal predecessors, (232), 0 states have call successors, (0), 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 136 states and 232 transitions. [2022-02-21 04:28:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:55,133 INFO L93 Difference]: Finished difference Result 136 states and 232 transitions. [2022-02-21 04:28:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 232 transitions. [2022-02-21 04:28:55,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:55,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:55,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:55,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 135 states have internal predecessors, (232), 0 states have call successors, (0), 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 04:28:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 232 transitions. [2022-02-21 04:28:55,141 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2022-02-21 04:28:55,141 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 232 transitions. [2022-02-21 04:28:55,141 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:55,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 232 transitions. [2022-02-21 04:28:55,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2022-02-21 04:28:55,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:55,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:55,143 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:55,144 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:55,144 INFO L791 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 356#L285 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 294#L285-1 init_#res#1 := init_~tmp~0#1; 378#L450 main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 360#L22 assume !(0 == assume_abort_if_not_~cond#1); 361#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 418#L526-2 [2022-02-21 04:28:55,144 INFO L793 eck$LassoCheckResult]: Loop: 418#L526-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 422#L84 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 416#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 353#L88-1 ~mode1~0 := 0; 337#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 338#L116 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 347#L119 assume !(node2_~m2~0#1 != ~nomsg~0); 340#L119-1 ~mode2~0 := 0; 345#L116-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 420#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 305#L153 assume !(node3_~m3~0#1 != ~nomsg~0); 307#L153-1 ~mode3~0 := 0; 373#L150-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 409#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 410#L187 assume !(node4_~m4~0#1 != ~nomsg~0); 323#L187-1 ~mode4~0 := 0; 404#L184-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 357#L218 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 359#L221 assume !(node5_~m5~0#1 != ~nomsg~0); 312#L221-1 ~mode5~0 := 0; 315#L218-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 316#L252 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 325#L255 assume !(node6_~m6~0#1 != ~nomsg~0); 327#L255-1 ~mode6~0 := 0; 329#L252-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 423#L458 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 303#L458-1 check_#res#1 := check_~tmp~1#1; 424#L470 main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 366#L559 assume !(0 == assert_~arg#1 % 256); 367#L554 assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; 418#L526-2 [2022-02-21 04:28:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2022-02-21 04:28:55,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:55,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514916021] [2022-02-21 04:28:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:55,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {704#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {704#true} is VALID [2022-02-21 04:28:55,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {704#true} is VALID [2022-02-21 04:28:55,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {706#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:55,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {706#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {707#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:55,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {707#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {708#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:28:55,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {708#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {705#false} is VALID [2022-02-21 04:28:55,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {705#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {705#false} is VALID [2022-02-21 04:28:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:55,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:55,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514916021] [2022-02-21 04:28:55,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514916021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:55,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:55,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:55,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12091088] [2022-02-21 04:28:55,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:55,193 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash 959479027, now seen corresponding path program 2 times [2022-02-21 04:28:55,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:55,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328127960] [2022-02-21 04:28:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:55,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {709#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume !(node1_~m1~0#1 != ~nomsg~0); {709#true} is VALID [2022-02-21 04:28:55,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {709#true} ~mode1~0 := 0; {709#true} is VALID [2022-02-21 04:28:55,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {709#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {709#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#true} assume !(node2_~m2~0#1 != ~nomsg~0); {709#true} is VALID [2022-02-21 04:28:55,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#true} ~mode2~0 := 0; {709#true} is VALID [2022-02-21 04:28:55,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#true} assume !(node3_~m3~0#1 != ~nomsg~0); {709#true} is VALID [2022-02-21 04:28:55,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#true} ~mode3~0 := 0; {709#true} is VALID [2022-02-21 04:28:55,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#true} assume !(node4_~m4~0#1 != ~nomsg~0); {709#true} is VALID [2022-02-21 04:28:55,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#true} ~mode4~0 := 0; {709#true} is VALID [2022-02-21 04:28:55,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {709#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {709#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {709#true} assume !(node5_~m5~0#1 != ~nomsg~0); {709#true} is VALID [2022-02-21 04:28:55,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {709#true} ~mode5~0 := 0; {709#true} is VALID [2022-02-21 04:28:55,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {709#true} is VALID [2022-02-21 04:28:55,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {709#true} assume !(node6_~m6~0#1 != ~nomsg~0); {709#true} is VALID [2022-02-21 04:28:55,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {709#true} ~mode6~0 := 0; {709#true} is VALID [2022-02-21 04:28:55,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {709#true} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {709#true} is VALID [2022-02-21 04:28:55,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {709#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {711#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:55,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {711#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {712#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:55,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {713#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:28:55,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {710#false} is VALID [2022-02-21 04:28:55,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {710#false} assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; {710#false} is VALID [2022-02-21 04:28:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:55,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:55,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328127960] [2022-02-21 04:28:55,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328127960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:55,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:55,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:55,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372291704] [2022-02-21 04:28:55,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:55,297 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:55,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:55,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:55,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:55,298 INFO L87 Difference]: Start difference. First operand 136 states and 232 transitions. cyclomatic complexity: 97 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 04:28:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:55,769 INFO L93 Difference]: Finished difference Result 139 states and 234 transitions. [2022-02-21 04:28:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:55,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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 04:28:55,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:55,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 234 transitions. [2022-02-21 04:28:55,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2022-02-21 04:28:55,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 136 states and 191 transitions. [2022-02-21 04:28:55,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2022-02-21 04:28:55,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-02-21 04:28:55,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 191 transitions. [2022-02-21 04:28:55,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:55,788 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2022-02-21 04:28:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 191 transitions. [2022-02-21 04:28:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-02-21 04:28:55,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:55,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states and 191 transitions. Second operand has 136 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 135 states have internal predecessors, (191), 0 states have call successors, (0), 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 04:28:55,793 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states and 191 transitions. Second operand has 136 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 135 states have internal predecessors, (191), 0 states have call successors, (0), 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 04:28:55,794 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. Second operand has 136 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 135 states have internal predecessors, (191), 0 states have call successors, (0), 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 04:28:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:55,798 INFO L93 Difference]: Finished difference Result 136 states and 191 transitions. [2022-02-21 04:28:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2022-02-21 04:28:55,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:55,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:55,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 135 states have internal predecessors, (191), 0 states have call successors, (0), 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 136 states and 191 transitions. [2022-02-21 04:28:55,799 INFO L87 Difference]: Start difference. First operand has 136 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 135 states have internal predecessors, (191), 0 states have call successors, (0), 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 136 states and 191 transitions. [2022-02-21 04:28:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:55,803 INFO L93 Difference]: Finished difference Result 136 states and 191 transitions. [2022-02-21 04:28:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2022-02-21 04:28:55,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:55,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:55,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:55,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 135 states have internal predecessors, (191), 0 states have call successors, (0), 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 04:28:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2022-02-21 04:28:55,808 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2022-02-21 04:28:55,808 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 191 transitions. [2022-02-21 04:28:55,808 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:55,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 191 transitions. [2022-02-21 04:28:55,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2022-02-21 04:28:55,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:55,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:55,811 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:55,811 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:55,812 INFO L791 eck$LassoCheckResult]: Stem: 991#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 918#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 919#L285 assume 0 == ~r1~0; 976#L286 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 953#L287 assume ~id1~0 >= 0; 906#L288 assume 0 == ~st1~0; 907#L289 assume ~send1~0 == ~id1~0; 914#L290 assume 0 == ~mode1~0 % 256; 967#L291 assume ~id2~0 >= 0; 968#L292 assume 0 == ~st2~0; 979#L293 assume ~send2~0 == ~id2~0; 990#L294 assume 0 == ~mode2~0 % 256; 863#L295 assume ~id3~0 >= 0; 864#L296 assume 0 == ~st3~0; 913#L297 assume ~send3~0 == ~id3~0; 911#L298 assume 0 == ~mode3~0 % 256; 912#L299 assume ~id4~0 >= 0; 917#L300 assume 0 == ~st4~0; 958#L301 assume ~send4~0 == ~id4~0; 971#L302 assume 0 == ~mode4~0 % 256; 972#L303 assume ~id5~0 >= 0; 985#L304 assume 0 == ~st5~0; 947#L305 assume ~send5~0 == ~id5~0; 948#L306 assume 0 == ~mode5~0 % 256; 965#L307 assume ~id6~0 >= 0; 876#L308 assume 0 == ~st6~0; 877#L309 assume ~send6~0 == ~id6~0; 962#L310 assume 0 == ~mode6~0 % 256; 937#L311 assume ~id1~0 != ~id2~0; 938#L312 assume ~id1~0 != ~id3~0; 895#L313 assume ~id1~0 != ~id4~0; 896#L314 assume ~id1~0 != ~id5~0; 930#L315 assume ~id1~0 != ~id6~0; 931#L316 assume ~id2~0 != ~id3~0; 859#L317 assume ~id2~0 != ~id4~0; 860#L318 assume ~id2~0 != ~id5~0; 992#L319 assume ~id2~0 != ~id6~0; 970#L320 assume ~id3~0 != ~id4~0; 954#L321 assume ~id3~0 != ~id5~0; 955#L322 assume ~id3~0 != ~id6~0; 857#L323 assume ~id4~0 != ~id5~0; 858#L324 assume ~id4~0 != ~id6~0; 884#L325 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 941#L285-1 init_#res#1 := init_~tmp~0#1; 942#L450 main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 923#L22 assume !(0 == assume_abort_if_not_~cond#1); 924#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 982#L526-2 [2022-02-21 04:28:55,812 INFO L793 eck$LassoCheckResult]: Loop: 982#L526-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 986#L84 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 980#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 916#L88-1 ~mode1~0 := 0; 900#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 901#L116 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 910#L119 assume !(node2_~m2~0#1 != ~nomsg~0); 903#L119-1 ~mode2~0 := 0; 908#L116-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 984#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 868#L153 assume !(node3_~m3~0#1 != ~nomsg~0); 870#L153-1 ~mode3~0 := 0; 936#L150-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 973#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 974#L187 assume !(node4_~m4~0#1 != ~nomsg~0); 886#L187-1 ~mode4~0 := 0; 966#L184-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 920#L218 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 922#L221 assume !(node5_~m5~0#1 != ~nomsg~0); 875#L221-1 ~mode5~0 := 0; 878#L218-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 879#L252 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 888#L255 assume !(node6_~m6~0#1 != ~nomsg~0); 890#L255-1 ~mode6~0 := 0; 892#L252-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 987#L458 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 866#L458-1 check_#res#1 := check_~tmp~1#1; 988#L470 main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 928#L559 assume !(0 == assert_~arg#1 % 256); 929#L554 assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; 982#L526-2 [2022-02-21 04:28:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2022-02-21 04:28:55,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:55,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677779280] [2022-02-21 04:28:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:55,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:55,948 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash 959479027, now seen corresponding path program 3 times [2022-02-21 04:28:55,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:55,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119681894] [2022-02-21 04:28:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:56,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {1270#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume !(node1_~m1~0#1 != ~nomsg~0); {1270#true} is VALID [2022-02-21 04:28:56,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {1270#true} ~mode1~0 := 0; {1270#true} is VALID [2022-02-21 04:28:56,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {1270#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {1270#true} assume !(node2_~m2~0#1 != ~nomsg~0); {1270#true} is VALID [2022-02-21 04:28:56,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#true} ~mode2~0 := 0; {1270#true} is VALID [2022-02-21 04:28:56,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {1270#true} assume !(node3_~m3~0#1 != ~nomsg~0); {1270#true} is VALID [2022-02-21 04:28:56,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#true} ~mode3~0 := 0; {1270#true} is VALID [2022-02-21 04:28:56,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(node4_~m4~0#1 != ~nomsg~0); {1270#true} is VALID [2022-02-21 04:28:56,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} ~mode4~0 := 0; {1270#true} is VALID [2022-02-21 04:28:56,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {1270#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {1270#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {1270#true} assume !(node5_~m5~0#1 != ~nomsg~0); {1270#true} is VALID [2022-02-21 04:28:56,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {1270#true} ~mode5~0 := 0; {1270#true} is VALID [2022-02-21 04:28:56,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {1270#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {1270#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1270#true} is VALID [2022-02-21 04:28:56,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {1270#true} assume !(node6_~m6~0#1 != ~nomsg~0); {1270#true} is VALID [2022-02-21 04:28:56,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {1270#true} ~mode6~0 := 0; {1270#true} is VALID [2022-02-21 04:28:56,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {1270#true} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1270#true} is VALID [2022-02-21 04:28:56,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {1270#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1272#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:56,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {1272#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {1273#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:56,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1274#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:28:56,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {1274#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {1271#false} is VALID [2022-02-21 04:28:56,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {1271#false} assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; {1271#false} is VALID [2022-02-21 04:28:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:56,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:56,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119681894] [2022-02-21 04:28:56,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119681894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:56,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:56,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:56,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775081762] [2022-02-21 04:28:56,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:56,054 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:56,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:56,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:56,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:56,055 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. cyclomatic complexity: 56 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:28:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:56,451 INFO L93 Difference]: Finished difference Result 139 states and 193 transitions. [2022-02-21 04:28:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:56,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:28:56,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:56,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 193 transitions. [2022-02-21 04:28:56,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2022-02-21 04:28:56,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 136 states and 189 transitions. [2022-02-21 04:28:56,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2022-02-21 04:28:56,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-02-21 04:28:56,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 189 transitions. [2022-02-21 04:28:56,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:56,491 INFO L681 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2022-02-21 04:28:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 189 transitions. [2022-02-21 04:28:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-02-21 04:28:56,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:56,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states and 189 transitions. Second operand has 136 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 135 states have internal predecessors, (189), 0 states have call successors, (0), 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 04:28:56,504 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states and 189 transitions. Second operand has 136 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 135 states have internal predecessors, (189), 0 states have call successors, (0), 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 04:28:56,504 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 136 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 135 states have internal predecessors, (189), 0 states have call successors, (0), 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 04:28:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:56,507 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2022-02-21 04:28:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2022-02-21 04:28:56,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:56,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:56,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 135 states have internal predecessors, (189), 0 states have call successors, (0), 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 136 states and 189 transitions. [2022-02-21 04:28:56,509 INFO L87 Difference]: Start difference. First operand has 136 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 135 states have internal predecessors, (189), 0 states have call successors, (0), 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 136 states and 189 transitions. [2022-02-21 04:28:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:56,512 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2022-02-21 04:28:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2022-02-21 04:28:56,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:56,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:56,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:56,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 135 states have internal predecessors, (189), 0 states have call successors, (0), 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 04:28:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2022-02-21 04:28:56,517 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2022-02-21 04:28:56,517 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 189 transitions. [2022-02-21 04:28:56,517 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:56,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 189 transitions. [2022-02-21 04:28:56,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2022-02-21 04:28:56,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:56,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:56,520 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:56,520 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:56,520 INFO L791 eck$LassoCheckResult]: Stem: 1552#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 1479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1480#L285 assume 0 == ~r1~0; 1537#L286 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 1514#L287 assume ~id1~0 >= 0; 1466#L288 assume 0 == ~st1~0; 1467#L289 assume ~send1~0 == ~id1~0; 1475#L290 assume 0 == ~mode1~0 % 256; 1527#L291 assume ~id2~0 >= 0; 1528#L292 assume 0 == ~st2~0; 1540#L293 assume ~send2~0 == ~id2~0; 1551#L294 assume 0 == ~mode2~0 % 256; 1424#L295 assume ~id3~0 >= 0; 1425#L296 assume 0 == ~st3~0; 1474#L297 assume ~send3~0 == ~id3~0; 1472#L298 assume 0 == ~mode3~0 % 256; 1473#L299 assume ~id4~0 >= 0; 1478#L300 assume 0 == ~st4~0; 1519#L301 assume ~send4~0 == ~id4~0; 1532#L302 assume 0 == ~mode4~0 % 256; 1533#L303 assume ~id5~0 >= 0; 1545#L304 assume 0 == ~st5~0; 1507#L305 assume ~send5~0 == ~id5~0; 1508#L306 assume 0 == ~mode5~0 % 256; 1526#L307 assume ~id6~0 >= 0; 1435#L308 assume 0 == ~st6~0; 1436#L309 assume ~send6~0 == ~id6~0; 1523#L310 assume 0 == ~mode6~0 % 256; 1497#L311 assume ~id1~0 != ~id2~0; 1498#L312 assume ~id1~0 != ~id3~0; 1456#L313 assume ~id1~0 != ~id4~0; 1457#L314 assume ~id1~0 != ~id5~0; 1488#L315 assume ~id1~0 != ~id6~0; 1489#L316 assume ~id2~0 != ~id3~0; 1420#L317 assume ~id2~0 != ~id4~0; 1421#L318 assume ~id2~0 != ~id5~0; 1553#L319 assume ~id2~0 != ~id6~0; 1531#L320 assume ~id3~0 != ~id4~0; 1515#L321 assume ~id3~0 != ~id5~0; 1516#L322 assume ~id3~0 != ~id6~0; 1418#L323 assume ~id4~0 != ~id5~0; 1419#L324 assume ~id4~0 != ~id6~0; 1442#L325 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 1502#L285-1 init_#res#1 := init_~tmp~0#1; 1503#L450 main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1484#L22 assume !(0 == assume_abort_if_not_~cond#1); 1485#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1543#L526-2 [2022-02-21 04:28:56,520 INFO L793 eck$LassoCheckResult]: Loop: 1543#L526-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1547#L84 assume !(0 != ~mode1~0 % 256); 1493#L102 assume !(0 != ~alive1~0 % 256); 1490#L102-2 ~mode1~0 := 1; 1461#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1462#L116 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1471#L119 assume !(node2_~m2~0#1 != ~nomsg~0); 1464#L119-1 ~mode2~0 := 0; 1469#L116-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1546#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1429#L153 assume !(node3_~m3~0#1 != ~nomsg~0); 1431#L153-1 ~mode3~0 := 0; 1499#L150-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1534#L184 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1535#L187 assume !(node4_~m4~0#1 != ~nomsg~0); 1447#L187-1 ~mode4~0 := 0; 1529#L184-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1481#L218 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1483#L221 assume !(node5_~m5~0#1 != ~nomsg~0); 1438#L221-1 ~mode5~0 := 0; 1439#L218-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1440#L252 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1449#L255 assume !(node6_~m6~0#1 != ~nomsg~0); 1451#L255-1 ~mode6~0 := 0; 1453#L252-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1548#L458 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1426#L459 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 1427#L458-1 check_#res#1 := check_~tmp~1#1; 1549#L470 main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1491#L559 assume !(0 == assert_~arg#1 % 256); 1492#L554 assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; 1543#L526-2 [2022-02-21 04:28:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2022-02-21 04:28:56,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:56,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695038433] [2022-02-21 04:28:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:56,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:56,593 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:56,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1986121047, now seen corresponding path program 1 times [2022-02-21 04:28:56,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:56,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017659413] [2022-02-21 04:28:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:56,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:56,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:56,630 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:56,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1111090168, now seen corresponding path program 1 times [2022-02-21 04:28:56,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:56,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692570285] [2022-02-21 04:28:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:56,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {1833#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {1833#true} is VALID [2022-02-21 04:28:56,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {1833#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1833#true} is VALID [2022-02-21 04:28:56,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {1833#true} assume 0 == ~r1~0; {1833#true} is VALID [2022-02-21 04:28:56,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {1833#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1833#true} is VALID [2022-02-21 04:28:56,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {1833#true} assume ~id1~0 >= 0; {1833#true} is VALID [2022-02-21 04:28:56,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {1833#true} assume 0 == ~st1~0; {1833#true} is VALID [2022-02-21 04:28:56,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {1833#true} assume ~send1~0 == ~id1~0; {1833#true} is VALID [2022-02-21 04:28:56,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {1833#true} assume 0 == ~mode1~0 % 256; {1833#true} is VALID [2022-02-21 04:28:56,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {1833#true} assume ~id2~0 >= 0; {1833#true} is VALID [2022-02-21 04:28:56,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {1833#true} assume 0 == ~st2~0; {1833#true} is VALID [2022-02-21 04:28:56,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {1833#true} assume ~send2~0 == ~id2~0; {1833#true} is VALID [2022-02-21 04:28:56,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {1833#true} assume 0 == ~mode2~0 % 256; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:56,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {1835#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {1834#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1834#false} is VALID [2022-02-21 04:28:56,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {1834#false} ~mode2~0 := 0; {1834#false} is VALID [2022-02-21 04:28:56,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {1834#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {1834#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {1834#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1834#false} is VALID [2022-02-21 04:28:56,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {1834#false} ~mode3~0 := 0; {1834#false} is VALID [2022-02-21 04:28:56,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {1834#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {1834#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {1834#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1834#false} is VALID [2022-02-21 04:28:56,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {1834#false} ~mode4~0 := 0; {1834#false} is VALID [2022-02-21 04:28:56,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {1834#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {1834#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {1834#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1834#false} is VALID [2022-02-21 04:28:56,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {1834#false} ~mode5~0 := 0; {1834#false} is VALID [2022-02-21 04:28:56,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {1834#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {1834#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1834#false} is VALID [2022-02-21 04:28:56,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {1834#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1834#false} is VALID [2022-02-21 04:28:56,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {1834#false} ~mode6~0 := 0; {1834#false} is VALID [2022-02-21 04:28:56,738 INFO L290 TraceCheckUtils]: 71: Hoare triple {1834#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1834#false} is VALID [2022-02-21 04:28:56,738 INFO L290 TraceCheckUtils]: 72: Hoare triple {1834#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1834#false} is VALID [2022-02-21 04:28:56,738 INFO L290 TraceCheckUtils]: 73: Hoare triple {1834#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {1834#false} is VALID [2022-02-21 04:28:56,738 INFO L290 TraceCheckUtils]: 74: Hoare triple {1834#false} check_#res#1 := check_~tmp~1#1; {1834#false} is VALID [2022-02-21 04:28:56,738 INFO L290 TraceCheckUtils]: 75: Hoare triple {1834#false} main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1834#false} is VALID [2022-02-21 04:28:56,738 INFO L290 TraceCheckUtils]: 76: Hoare triple {1834#false} assume !(0 == assert_~arg#1 % 256); {1834#false} is VALID [2022-02-21 04:28:56,738 INFO L290 TraceCheckUtils]: 77: Hoare triple {1834#false} assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; {1834#false} is VALID [2022-02-21 04:28:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:56,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:56,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692570285] [2022-02-21 04:28:56,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692570285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:56,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:56,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:56,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804135233] [2022-02-21 04:28:56,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:57,658 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:57,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:57,659 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:57,659 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:57,659 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:57,659 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:57,659 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:57,659 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:57,660 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-02-21 04:28:57,660 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:57,660 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:57,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,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 04:28:57,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 04:28:57,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:57,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,616 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:58,617 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:58,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:58,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:58,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:58,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:58,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:58,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:28:58,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:58,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:58,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:58,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:58,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:58,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:58,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:28:58,836 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:58,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:58,840 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:58,840 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:58,841 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:58,841 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:58,841 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:58,841 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:58,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:58,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:58,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-02-21 04:28:58,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:58,841 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:58,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:58,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:59,760 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:59,764 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:59,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:59,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:59,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:28:59,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 04:28:59,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:59,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:59,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:59,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:59,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:59,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:59,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:59,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:59,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:59,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:59,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:59,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:59,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:59,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:59,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:59,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:59,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:59,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:59,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:59,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:59,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:28:59,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:59,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:59,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:59,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:59,863 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:59,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:28:59,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:59,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:59,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:59,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:59,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:59,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:59,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:59,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:59,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:59,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:59,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:59,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:59,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:59,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:28:59,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:59,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:59,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:59,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:59,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:59,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:59,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:59,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:59,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:59,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:59,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:59,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:59,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:59,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:28:59,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:59,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:59,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:59,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:59,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:59,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:59,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:59,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:59,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:59,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:59,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:59,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:59,963 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:59,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:28:59,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:59,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:59,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:59,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:59,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:59,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:59,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:59,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:59,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:59,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:59,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:59,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:28:59,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:00,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:29:00,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:00,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:29:00,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:00,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,144 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:29:00,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:00,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,177 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:29:00,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 04:29:00,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,217 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:29:00,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:29:00,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,254 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:29:00,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:29:00,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,296 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:29:00,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:00,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,333 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:29:00,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,360 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 04:29:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,364 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:29:00,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:00,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:00,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,420 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:29:00,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:29:00,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:00,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:00,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:00,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:00,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:00,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:00,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:00,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:29:00,445 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:29:00,445 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:29:00,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,471 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:00,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:29:00,514 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:29:00,514 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:29:00,515 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 23 Supporting invariants [] [2022-02-21 04:29:00,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:29:00,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:00,565 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:29:00,572 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);" "assume !(0 != ~alive1~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0#1 != ~nomsg~0);" "~mode2~0 := 0;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0#1 != ~nomsg~0);" "~mode3~0 := 0;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0#1 != ~nomsg~0);" "~mode4~0 := 0;" "assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0#1 != ~nomsg~0);" "~mode5~0 := 0;" "assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0;" "assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node6_~m6~0#1 != ~nomsg~0);" "~mode6~0 := 0;" "assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1;" "assume ~r1~0 < 6;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1;" [2022-02-21 04:29:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:00,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:29:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:00,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:29:00,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {1836#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {1836#unseeded} is VALID [2022-02-21 04:29:00,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~post48#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~alive3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~alive4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~alive5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~id6~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~st6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~send6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~alive6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1836#unseeded} is VALID [2022-02-21 04:29:00,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#unseeded} assume 0 == ~r1~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {1836#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1836#unseeded} is VALID [2022-02-21 04:29:00,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {1836#unseeded} assume ~id1~0 >= 0; {1836#unseeded} is VALID [2022-02-21 04:29:00,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#unseeded} assume 0 == ~st1~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {1836#unseeded} assume ~send1~0 == ~id1~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {1836#unseeded} assume 0 == ~mode1~0 % 256; {1836#unseeded} is VALID [2022-02-21 04:29:00,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {1836#unseeded} assume ~id2~0 >= 0; {1836#unseeded} is VALID [2022-02-21 04:29:00,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {1836#unseeded} assume 0 == ~st2~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {1836#unseeded} assume ~send2~0 == ~id2~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {1836#unseeded} assume 0 == ~mode2~0 % 256; {1836#unseeded} is VALID [2022-02-21 04:29:00,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {1836#unseeded} assume ~id3~0 >= 0; {1836#unseeded} is VALID [2022-02-21 04:29:00,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#unseeded} assume 0 == ~st3~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {1836#unseeded} assume ~send3~0 == ~id3~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {1836#unseeded} assume 0 == ~mode3~0 % 256; {1836#unseeded} is VALID [2022-02-21 04:29:00,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {1836#unseeded} assume ~id4~0 >= 0; {1836#unseeded} is VALID [2022-02-21 04:29:00,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {1836#unseeded} assume 0 == ~st4~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {1836#unseeded} assume ~send4~0 == ~id4~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {1836#unseeded} assume 0 == ~mode4~0 % 256; {1836#unseeded} is VALID [2022-02-21 04:29:00,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {1836#unseeded} assume ~id5~0 >= 0; {1836#unseeded} is VALID [2022-02-21 04:29:00,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {1836#unseeded} assume 0 == ~st5~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {1836#unseeded} assume ~send5~0 == ~id5~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {1836#unseeded} assume 0 == ~mode5~0 % 256; {1836#unseeded} is VALID [2022-02-21 04:29:00,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {1836#unseeded} assume ~id6~0 >= 0; {1836#unseeded} is VALID [2022-02-21 04:29:00,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {1836#unseeded} assume 0 == ~st6~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {1836#unseeded} assume ~send6~0 == ~id6~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {1836#unseeded} assume 0 == ~mode6~0 % 256; {1836#unseeded} is VALID [2022-02-21 04:29:00,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {1836#unseeded} assume ~id1~0 != ~id2~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {1836#unseeded} assume ~id1~0 != ~id3~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {1836#unseeded} assume ~id1~0 != ~id4~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {1836#unseeded} assume ~id1~0 != ~id5~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {1836#unseeded} assume ~id1~0 != ~id6~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {1836#unseeded} assume ~id2~0 != ~id3~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {1836#unseeded} assume ~id2~0 != ~id4~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {1836#unseeded} assume ~id2~0 != ~id5~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {1836#unseeded} assume ~id2~0 != ~id6~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {1836#unseeded} assume ~id3~0 != ~id4~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {1836#unseeded} assume ~id3~0 != ~id5~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {1836#unseeded} assume ~id3~0 != ~id6~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {1836#unseeded} assume ~id4~0 != ~id5~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {1836#unseeded} assume ~id4~0 != ~id6~0; {1836#unseeded} is VALID [2022-02-21 04:29:00,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {1836#unseeded} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1836#unseeded} is VALID [2022-02-21 04:29:00,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {1836#unseeded} init_#res#1 := init_~tmp~0#1; {1836#unseeded} is VALID [2022-02-21 04:29:00,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {1836#unseeded} main_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1836#unseeded} is VALID [2022-02-21 04:29:00,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {1836#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1836#unseeded} is VALID [2022-02-21 04:29:00,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {1836#unseeded} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1836#unseeded} is VALID [2022-02-21 04:29:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:00,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:29:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:00,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:29:01,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {1839#(>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(0 != ~mode1~0 % 256); {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(0 != ~alive1~0 % 256); {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode1~0 := 1; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node2_~m2~0#1 != ~nomsg~0); {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode2~0 := 0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node3_~m3~0#1 != ~nomsg~0); {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode3~0 := 0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node4_~m4~0#1 != ~nomsg~0); {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode4~0 := 0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:01,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node5_~m5~0#1 != ~nomsg~0); {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode5~0 := 0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite13#1, node6_#t~ite14#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node6_~m6~0#1 != ~nomsg~0); {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode6~0 := 0; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} check_#res#1 := check_~tmp~1#1; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} main_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(0 == assert_~arg#1 % 256); {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:01,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {1992#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_assert } true;main_#t~post48#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post48#1;havoc main_#t~post48#1; {1849#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:29:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:01,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 04:29:01,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:01,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:01,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,215 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:29:01,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 189 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 04:29:01,496 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 189 transitions. cyclomatic complexity: 54. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 225 states and 332 transitions. Complement of second has 4 states. [2022-02-21 04:29:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:29:01,497 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:29:01,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 189 transitions. cyclomatic complexity: 54 [2022-02-21 04:29:01,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:01,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:01,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 04:29:01,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:29:01,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:01,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:01,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 332 transitions. [2022-02-21 04:29:01,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:01,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:01,508 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 136 states and 189 transitions. cyclomatic complexity: 54 [2022-02-21 04:29:01,557 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 89 examples of accepted words. [2022-02-21 04:29:01,557 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 04:29:01,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:29:01,561 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:29:01,561 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 225 states and 332 transitions. cyclomatic complexity: 108 [2022-02-21 04:29:01,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 332 transitions. cyclomatic complexity: 108 [2022-02-21 04:29:01,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:01,561 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:29:01,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:01,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:01,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:01,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:29:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 225 letters. Loop has 225 letters. [2022-02-21 04:29:01,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 225 letters. Loop has 225 letters. [2022-02-21 04:29:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 225 letters. Loop has 225 letters. [2022-02-21 04:29:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 136 letters. Loop has 136 letters. [2022-02-21 04:29:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 136 letters. [2022-02-21 04:29:01,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 136 letters. Loop has 136 letters. [2022-02-21 04:29:01,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:29:01,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:29:01,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:29:01,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:01,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:01,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:01,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:01,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:01,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:01,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:01,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:01,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:01,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:29:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:29:01,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:29:01,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:29:01,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:29:01,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:29:01,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:29:01,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:29:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 72 letters. Loop has 31 letters. [2022-02-21 04:29:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:01,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 72 letters. Loop has 31 letters. [2022-02-21 04:29:01,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 75 letters. Loop has 31 letters. [2022-02-21 04:29:01,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 31 letters. [2022-02-21 04:29:01,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 75 letters. Loop has 31 letters. [2022-02-21 04:29:01,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:29:01,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:29:01,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:29:01,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:29:01,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:29:01,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:29:01,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:01,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:01,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:01,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 73 letters. Loop has 31 letters. [2022-02-21 04:29:01,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 31 letters. [2022-02-21 04:29:01,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 73 letters. Loop has 31 letters. [2022-02-21 04:29:01,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:29:01,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:01,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:29:01,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:29:01,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:01,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:29:01,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:29:01,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:29:01,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:29:01,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:01,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:01,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:01,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:29:01,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:29:01,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:29:01,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:29:01,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:29:01,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:29:01,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:01,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:01,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:01,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:29:01,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:29:01,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:29:01,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:01,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:01,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:01,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 66 letters. Loop has 31 letters. [2022-02-21 04:29:01,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 31 letters. [2022-02-21 04:29:01,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 66 letters. Loop has 31 letters. [2022-02-21 04:29:01,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 31 letters. [2022-02-21 04:29:01,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:01,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 31 letters. [2022-02-21 04:29:01,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 68 letters. Loop has 31 letters. [2022-02-21 04:29:01,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 31 letters. [2022-02-21 04:29:01,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 68 letters. Loop has 31 letters. [2022-02-21 04:29:01,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:29:01,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:01,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:29:01,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:01,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:01,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:01,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 34 letters. [2022-02-21 04:29:01,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:01,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 34 letters. [2022-02-21 04:29:01,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:29:01,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:01,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:29:01,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:01,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:01,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:01,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:29:01,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:29:01,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:29:01,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:01,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:01,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:01,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 69 letters. Loop has 31 letters. [2022-02-21 04:29:01,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 31 letters. [2022-02-21 04:29:01,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 69 letters. Loop has 31 letters. [2022-02-21 04:29:01,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:01,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:01,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:01,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 70 letters. Loop has 31 letters. [2022-02-21 04:29:01,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 31 letters. [2022-02-21 04:29:01,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 70 letters. Loop has 31 letters. [2022-02-21 04:29:01,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:29:01,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:29:01,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:29:01,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 31 letters. [2022-02-21 04:29:01,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 31 letters. [2022-02-21 04:29:01,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 31 letters. [2022-02-21 04:29:01,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:29:01,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:29:01,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:29:01,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:01,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:01,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:01,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:01,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:01,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:01,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 34 letters. [2022-02-21 04:29:01,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:01,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 34 letters. [2022-02-21 04:29:01,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:29:01,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:01,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:29:01,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:29:01,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:29:01,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:29:01,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:29:01,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:29:01,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:29:01,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:01,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:01,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:01,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:29:01,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:29:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:29:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:01,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:01,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:01,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:01,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:01,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:01,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:29:01,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:01,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:29:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:29:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:29:01,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:29:01,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:01,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:29:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:29:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:29:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:29:01,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:01,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 64 letters. Loop has 31 letters. [2022-02-21 04:29:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 31 letters. [2022-02-21 04:29:01,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 64 letters. Loop has 31 letters. [2022-02-21 04:29:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:29:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:29:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:29:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 65 letters. Loop has 31 letters. [2022-02-21 04:29:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 31 letters. [2022-02-21 04:29:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 65 letters. Loop has 31 letters. [2022-02-21 04:29:01,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:01,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:01,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:01,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 34 letters. [2022-02-21 04:29:01,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 34 letters. [2022-02-21 04:29:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 34 letters. [2022-02-21 04:29:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:01,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:01,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:01,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 76 letters. Loop has 31 letters. [2022-02-21 04:29:01,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 31 letters. [2022-02-21 04:29:01,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 76 letters. Loop has 31 letters. [2022-02-21 04:29:01,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 77 letters. Loop has 31 letters. [2022-02-21 04:29:01,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 31 letters. [2022-02-21 04:29:01,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 77 letters. Loop has 31 letters. [2022-02-21 04:29:01,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:01,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:01,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:01,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:29:01,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:29:01,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:29:01,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:01,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:01,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:01,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:01,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:01,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:01,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:29:01,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:29:01,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:29:01,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:29:01,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:29:01,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:29:01,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:01,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:01,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:01,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:01,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:01,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:01,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:29:01,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:29:01,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:29:01,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:01,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:01,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:01,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:01,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:01,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:01,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:01,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:01,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:01,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:29:01,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:29:01,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:29:01,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:01,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:01,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:01,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:29:01,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:29:01,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:29:01,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:01,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:01,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:01,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:01,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:01,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:01,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:29:01,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:29:01,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:29:01,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:29:01,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:29:01,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:29:01,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:01,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:01,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:01,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:29:01,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:29:01,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:29:01,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:01,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:01,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:01,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 63 letters. Loop has 31 letters. [2022-02-21 04:29:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 31 letters. [2022-02-21 04:29:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 63 letters. Loop has 31 letters. [2022-02-21 04:29:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:29:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:29:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:29:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:29:01,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:29:01,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:29:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:29:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 136 states and 189 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 04:29:01,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 225 states and 332 transitions. cyclomatic complexity: 108 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:01,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,698 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:29:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 04:29:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-21 04:29:01,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 189 transitions. Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:01,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 189 transitions. Stem has 78 letters. Loop has 31 letters. [2022-02-21 04:29:01,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 189 transitions. Stem has 47 letters. Loop has 62 letters. [2022-02-21 04:29:01,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:01,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 332 transitions. cyclomatic complexity: 108 [2022-02-21 04:29:01,708 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:01,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 0 states and 0 transitions. [2022-02-21 04:29:01,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:29:01,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:29:01,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:29:01,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:01,709 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:01,709 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:01,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:01,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:29:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:29:01,710 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 04:29:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:01,710 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:29:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:29:01,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 04:29:01,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:01,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:29:01,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:01,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:29:01,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:29:01,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:29:01,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:29:01,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:01,778 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:01,778 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:01,778 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:01,778 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:29:01,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:29:01,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:01,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:01,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:29:01 BoogieIcfgContainer [2022-02-21 04:29:01,785 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:29:01,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:29:01,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:29:01,785 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:29:01,786 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:54" (3/4) ... [2022-02-21 04:29:01,788 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:29:01,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:29:01,808 INFO L158 Benchmark]: Toolchain (without parser) took 8768.62ms. Allocated memory was 100.7MB in the beginning and 182.5MB in the end (delta: 81.8MB). Free memory was 67.4MB in the beginning and 48.3MB in the end (delta: 19.1MB). Peak memory consumption was 100.3MB. Max. memory is 16.1GB. [2022-02-21 04:29:01,808 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:29:01,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.04ms. Allocated memory is still 100.7MB. Free memory was 67.1MB in the beginning and 66.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:29:01,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.74ms. Allocated memory is still 100.7MB. Free memory was 66.0MB in the beginning and 62.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:29:01,809 INFO L158 Benchmark]: Boogie Preprocessor took 55.07ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 59.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:29:01,809 INFO L158 Benchmark]: RCFGBuilder took 632.70ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 59.7MB in the beginning and 83.1MB in the end (delta: -23.4MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2022-02-21 04:29:01,809 INFO L158 Benchmark]: BuchiAutomizer took 7570.64ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 82.5MB in the beginning and 48.3MB in the end (delta: 34.3MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2022-02-21 04:29:01,809 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 182.5MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:29:01,814 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 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.04ms. Allocated memory is still 100.7MB. Free memory was 67.1MB in the beginning and 66.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.74ms. Allocated memory is still 100.7MB. Free memory was 66.0MB in the beginning and 62.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.07ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 59.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 632.70ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 59.7MB in the beginning and 83.1MB in the end (delta: -23.4MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7570.64ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 82.5MB in the beginning and 48.3MB in the end (delta: 34.3MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 182.5MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 23 + -2 * i2 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 136 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 2190 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1347 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 843 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:29:01,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE