./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.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.1.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 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:46,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:46,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:46,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:46,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:46,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:46,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:46,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:46,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:46,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:46,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:46,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:46,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:46,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:46,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:46,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:46,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:46,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:46,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:46,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:46,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:46,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:46,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:46,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:46,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:46,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:46,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:46,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:46,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:46,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:46,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:46,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:46,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:46,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:46,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:46,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:46,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:46,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:46,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:46,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:46,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:46,405 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:46,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:46,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:46,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:46,438 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:46,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:46,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:46,439 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:46,439 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:46,440 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:46,440 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:46,440 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:46,440 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:46,441 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:46,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:46,441 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:46,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:46,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:46,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:46,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:46,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:46,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:46,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:46,442 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:46,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:46,443 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:46,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:46,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:46,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:46,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:46,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:46,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:46,445 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:46,445 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 -> 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f [2022-02-21 04:28:46,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:46,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:46,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:46,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:46,698 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:46,699 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.1.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:46,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473d6aac1/a9be40a0409947d5ad94a2d054b2ff6a/FLAG869167c26 [2022-02-21 04:28:47,144 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:47,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:47,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473d6aac1/a9be40a0409947d5ad94a2d054b2ff6a/FLAG869167c26 [2022-02-21 04:28:47,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473d6aac1/a9be40a0409947d5ad94a2d054b2ff6a [2022-02-21 04:28:47,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:47,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:47,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:47,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:47,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:47,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:47" (1/1) ... [2022-02-21 04:28:47,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@250cc950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:47, skipping insertion in model container [2022-02-21 04:28:47,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:47" (1/1) ... [2022-02-21 04:28:47,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:47,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:47,488 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.1.ufo.BOUNDED-12.pals.c[16977,16990] [2022-02-21 04:28:47,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:47,495 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:47,567 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.1.ufo.BOUNDED-12.pals.c[16977,16990] [2022-02-21 04:28:47,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:47,578 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:47,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:47 WrapperNode [2022-02-21 04:28:47,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:47,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:47,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:47,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:47,585 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:47" (1/1) ... [2022-02-21 04:28:47,604 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:47" (1/1) ... [2022-02-21 04:28:47,650 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 441 [2022-02-21 04:28:47,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:47,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:47,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:47,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:47,665 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:47" (1/1) ... [2022-02-21 04:28:47,665 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:47" (1/1) ... [2022-02-21 04:28:47,672 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:47" (1/1) ... [2022-02-21 04:28:47,672 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:47" (1/1) ... [2022-02-21 04:28:47,689 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:47" (1/1) ... [2022-02-21 04:28:47,695 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:47" (1/1) ... [2022-02-21 04:28:47,699 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:47" (1/1) ... [2022-02-21 04:28:47,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:47,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:47,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:47,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:47,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:47" (1/1) ... [2022-02-21 04:28:47,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,737 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:47,744 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:47,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:47,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:47,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:47,863 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:47,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:48,394 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:48,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:48,404 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:48,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:48 BoogieIcfgContainer [2022-02-21 04:28:48,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:48,407 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:48,408 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:48,410 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:48,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:48,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:47" (1/3) ... [2022-02-21 04:28:48,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a4fdeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:48, skipping insertion in model container [2022-02-21 04:28:48,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:48,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:47" (2/3) ... [2022-02-21 04:28:48,412 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a4fdeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:48, skipping insertion in model container [2022-02-21 04:28:48,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:48,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:48" (3/3) ... [2022-02-21 04:28:48,413 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:48,447 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:48,447 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:48,447 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:48,448 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:48,448 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:48,448 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:48,448 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:48,448 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:48,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 0 states have call successors, (0), 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:48,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-02-21 04:28:48,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:48,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:48,501 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:48,501 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:48,501 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:48,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 0 states have call successors, (0), 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:48,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-02-21 04:28:48,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:48,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:48,529 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:48,529 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:48,534 INFO L791 eck$LassoCheckResult]: Stem: 125#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~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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 134#L290true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 122#L290-1true init_#res#1 := init_~tmp~0#1; 5#L455true main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 43#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 103#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; 116#L531-2true [2022-02-21 04:28:48,535 INFO L793 eck$LassoCheckResult]: Loop: 116#L531-2true assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 123#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; 98#L88true assume !(node1_~m1~0#1 != ~nomsg~0); 119#L88-1true ~mode1~0 := 0; 25#L84-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 26#L121true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 82#L124true assume !(node2_~m2~0#1 != ~nomsg~0); 37#L124-1true ~mode2~0 := 0; 10#L121-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 48#L155true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 16#L158true assume !(node3_~m3~0#1 != ~nomsg~0); 97#L158-1true ~mode3~0 := 0; 104#L155-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 89#L189true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 99#L192true assume !(node4_~m4~0#1 != ~nomsg~0); 139#L192-1true ~mode4~0 := 0; 49#L189-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 63#L223true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 14#L226true assume !(node5_~m5~0#1 != ~nomsg~0); 42#L226-1true ~mode5~0 := 0; 54#L223-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 129#L257true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 64#L260true assume !(node6_~m6~0#1 != ~nomsg~0); 81#L260-1true ~mode6~0 := 0; 41#L257-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; 39#L463true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 138#L463-1true check_#res#1 := check_~tmp~1#1; 71#L475true main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 15#L564true assume !(0 == assert_~arg#1 % 256); 46#L559true assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 116#L531-2true [2022-02-21 04:28:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2022-02-21 04:28:48,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:48,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573238793] [2022-02-21 04:28:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:48,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:48,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#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; {148#true} is VALID [2022-02-21 04:28:48,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {148#true} is VALID [2022-02-21 04:28:48,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {148#true} is VALID [2022-02-21 04:28:48,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {148#true} init_#res#1 := init_~tmp~0#1; {148#true} is VALID [2022-02-21 04:28:48,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {148#true} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {148#true} is VALID [2022-02-21 04:28:48,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {149#false} is VALID [2022-02-21 04:28:48,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {149#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; {149#false} is VALID [2022-02-21 04:28:48,732 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:48,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:48,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573238793] [2022-02-21 04:28:48,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573238793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:48,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:48,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:28:48,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964913924] [2022-02-21 04:28:48,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:48,739 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:48,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 1 times [2022-02-21 04:28:48,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:48,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067274666] [2022-02-21 04:28:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:48,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:48,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#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; {150#true} is VALID [2022-02-21 04:28:48,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(node1_~m1~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:48,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#true} ~mode1~0 := 0; {150#true} is VALID [2022-02-21 04:28:48,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#true} assume !(node2_~m2~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:48,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {150#true} ~mode2~0 := 0; {150#true} is VALID [2022-02-21 04:28:48,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#true} assume !(node3_~m3~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:48,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#true} ~mode3~0 := 0; {150#true} is VALID [2022-02-21 04:28:48,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {150#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {150#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {150#true} assume !(node4_~m4~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:48,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {150#true} ~mode4~0 := 0; {150#true} is VALID [2022-02-21 04:28:48,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {150#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {150#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {150#true} assume !(node5_~m5~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:48,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {150#true} ~mode5~0 := 0; {150#true} is VALID [2022-02-21 04:28:48,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {150#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {150#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:48,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {150#true} assume !(node6_~m6~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:48,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {150#true} ~mode6~0 := 0; {150#true} is VALID [2022-02-21 04:28:48,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {150#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; {150#true} is VALID [2022-02-21 04:28:48,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {150#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {152#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:48,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {152#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {153#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:48,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {153#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {154#(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:48,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {154#(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); {151#false} is VALID [2022-02-21 04:28:48,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {151#false} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {151#false} is VALID [2022-02-21 04:28:48,941 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:48,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:48,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067274666] [2022-02-21 04:28:48,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067274666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:48,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:48,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:48,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909095275] [2022-02-21 04:28:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:48,944 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:48,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:48,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 04:28:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 04:28:48,971 INFO L87 Difference]: Start difference. First operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 0 states have call successors, (0), 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:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:49,071 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2022-02-21 04:28:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:49,072 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:49,079 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:49,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 242 transitions. [2022-02-21 04:28:49,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:49,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 139 states and 237 transitions. [2022-02-21 04:28:49,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-02-21 04:28:49,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-02-21 04:28:49,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 237 transitions. [2022-02-21 04:28:49,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:49,097 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2022-02-21 04:28:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 237 transitions. [2022-02-21 04:28:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-21 04:28:49,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:49,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 237 transitions. Second operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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:49,129 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 237 transitions. Second operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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:49,130 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. Second operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:49,135 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2022-02-21 04:28:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 237 transitions. [2022-02-21 04:28:49,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:49,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:49,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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 139 states and 237 transitions. [2022-02-21 04:28:49,137 INFO L87 Difference]: Start difference. First operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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 139 states and 237 transitions. [2022-02-21 04:28:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:49,141 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2022-02-21 04:28:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 237 transitions. [2022-02-21 04:28:49,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:49,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:49,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:49,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 237 transitions. [2022-02-21 04:28:49,147 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2022-02-21 04:28:49,147 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2022-02-21 04:28:49,147 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:49,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 237 transitions. [2022-02-21 04:28:49,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:49,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:49,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:49,149 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:49,149 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:49,149 INFO L791 eck$LassoCheckResult]: Stem: 435#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; 368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 369#L290 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 302#L290-1 init_#res#1 := init_~tmp~0#1; 304#L455 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 305#L22 assume !(0 == assume_abort_if_not_~cond#1); 373#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; 374#L531-2 [2022-02-21 04:28:49,150 INFO L793 eck$LassoCheckResult]: Loop: 374#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 434#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; 428#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 362#L88-1 ~mode1~0 := 0; 345#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 346#L121 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 348#L124 assume !(node2_~m2~0#1 != ~nomsg~0); 364#L124-1 ~mode2~0 := 0; 315#L121-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 316#L155 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 326#L158 assume !(node3_~m3~0#1 != ~nomsg~0); 328#L158-1 ~mode3~0 := 0; 409#L155-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 421#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 422#L192 assume !(node4_~m4~0#1 != ~nomsg~0); 391#L192-1 ~mode4~0 := 0; 381#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 382#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 321#L226 assume !(node5_~m5~0#1 != ~nomsg~0); 323#L226-1 ~mode5~0 := 0; 372#L223-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 385#L257 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 399#L260 assume !(node6_~m6~0#1 != ~nomsg~0); 393#L260-1 ~mode6~0 := 0; 371#L257-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; 365#L463 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 366#L463-1 check_#res#1 := check_~tmp~1#1; 406#L475 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 324#L564 assume !(0 == assert_~arg#1 % 256); 325#L559 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 374#L531-2 [2022-02-21 04:28:49,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2022-02-21 04:28:49,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:49,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252439720] [2022-02-21 04:28:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:49,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#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; {719#true} is VALID [2022-02-21 04:28:49,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {719#true} is VALID [2022-02-21 04:28:49,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {719#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {721#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:49,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {721#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {722#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:49,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {722#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {723#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:28:49,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {720#false} is VALID [2022-02-21 04:28:49,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {720#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; {720#false} is VALID [2022-02-21 04:28:49,200 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:49,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:49,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252439720] [2022-02-21 04:28:49,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252439720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:49,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:49,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:49,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875741665] [2022-02-21 04:28:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:49,201 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 2 times [2022-02-21 04:28:49,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:49,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585284786] [2022-02-21 04:28:49,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:49,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {724#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#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; {724#true} is VALID [2022-02-21 04:28:49,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume !(node1_~m1~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:49,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {724#true} ~mode1~0 := 0; {724#true} is VALID [2022-02-21 04:28:49,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {724#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {724#true} assume !(node2_~m2~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:49,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} ~mode2~0 := 0; {724#true} is VALID [2022-02-21 04:28:49,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {724#true} assume !(node3_~m3~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:49,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {724#true} ~mode3~0 := 0; {724#true} is VALID [2022-02-21 04:28:49,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} assume !(node4_~m4~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:49,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {724#true} ~mode4~0 := 0; {724#true} is VALID [2022-02-21 04:28:49,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} assume !(node5_~m5~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:49,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#true} ~mode5~0 := 0; {724#true} is VALID [2022-02-21 04:28:49,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:49,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {724#true} assume !(node6_~m6~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:49,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {724#true} ~mode6~0 := 0; {724#true} is VALID [2022-02-21 04:28:49,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {724#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; {724#true} is VALID [2022-02-21 04:28:49,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {724#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {726#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:49,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {726#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {727#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:49,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {727#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {728#(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:49,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {728#(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); {725#false} is VALID [2022-02-21 04:28:49,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {725#false} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {725#false} is VALID [2022-02-21 04:28:49,283 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:49,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:49,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585284786] [2022-02-21 04:28:49,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585284786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:49,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:49,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:49,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607167771] [2022-02-21 04:28:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:49,285 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:49,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:49,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:49,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:49,286 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. cyclomatic complexity: 99 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:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:49,655 INFO L93 Difference]: Finished difference Result 142 states and 239 transitions. [2022-02-21 04:28:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:49,655 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:49,661 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:49,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 239 transitions. [2022-02-21 04:28:49,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:49,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 196 transitions. [2022-02-21 04:28:49,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-02-21 04:28:49,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-02-21 04:28:49,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 196 transitions. [2022-02-21 04:28:49,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:49,671 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2022-02-21 04:28:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 196 transitions. [2022-02-21 04:28:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-21 04:28:49,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:49,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 196 transitions. Second operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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:49,690 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 196 transitions. Second operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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:49,690 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. Second operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:49,693 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-02-21 04:28:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-02-21 04:28:49,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:49,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:49,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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 139 states and 196 transitions. [2022-02-21 04:28:49,695 INFO L87 Difference]: Start difference. First operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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 139 states and 196 transitions. [2022-02-21 04:28:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:49,698 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-02-21 04:28:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-02-21 04:28:49,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:49,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:49,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:49,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2022-02-21 04:28:49,702 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2022-02-21 04:28:49,702 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2022-02-21 04:28:49,702 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:49,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 196 transitions. [2022-02-21 04:28:49,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:49,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:49,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:49,716 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:49,716 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:49,716 INFO L791 eck$LassoCheckResult]: Stem: 1011#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; 943#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 944#L290 assume 0 == ~r1~0; 989#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 990#L292 assume ~id1~0 >= 0; 1003#L293 assume 0 == ~st1~0; 1010#L294 assume ~send1~0 == ~id1~0; 886#L295 assume 0 == ~mode1~0 % 256; 887#L296 assume ~id2~0 >= 0; 929#L297 assume 0 == ~st2~0; 927#L298 assume ~send2~0 == ~id2~0; 928#L299 assume 0 == ~mode2~0 % 256; 938#L300 assume ~id3~0 >= 0; 977#L301 assume 0 == ~st3~0; 994#L302 assume ~send3~0 == ~id3~0; 995#L303 assume 0 == ~mode3~0 % 256; 1006#L304 assume ~id4~0 >= 0; 971#L305 assume 0 == ~st4~0; 972#L306 assume ~send4~0 == ~id4~0; 988#L307 assume 0 == ~mode4~0 % 256; 897#L308 assume ~id5~0 >= 0; 898#L309 assume 0 == ~st5~0; 984#L310 assume ~send5~0 == ~id5~0; 958#L311 assume 0 == ~mode5~0 % 256; 959#L312 assume ~id6~0 >= 0; 915#L313 assume 0 == ~st6~0; 916#L314 assume ~send6~0 == ~id6~0; 951#L315 assume 0 == ~mode6~0 % 256; 952#L316 assume ~id1~0 != ~id2~0; 884#L317 assume ~id1~0 != ~id3~0; 885#L318 assume ~id1~0 != ~id4~0; 1012#L319 assume ~id1~0 != ~id5~0; 993#L320 assume ~id1~0 != ~id6~0; 973#L321 assume ~id2~0 != ~id3~0; 974#L322 assume ~id2~0 != ~id4~0; 877#L323 assume ~id2~0 != ~id5~0; 878#L324 assume ~id2~0 != ~id6~0; 904#L325 assume ~id3~0 != ~id4~0; 924#L326 assume ~id3~0 != ~id5~0; 911#L327 assume ~id3~0 != ~id6~0; 912#L328 assume ~id4~0 != ~id5~0; 934#L329 assume ~id4~0 != ~id6~0; 935#L330 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 960#L290-1 init_#res#1 := init_~tmp~0#1; 879#L455 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 880#L22 assume !(0 == assume_abort_if_not_~cond#1); 948#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; 950#L531-2 [2022-02-21 04:28:49,717 INFO L793 eck$LassoCheckResult]: Loop: 950#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1009#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; 1004#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 937#L88-1 ~mode1~0 := 0; 920#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 921#L121 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 923#L124 assume !(node2_~m2~0#1 != ~nomsg~0); 939#L124-1 ~mode2~0 := 0; 888#L121-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 889#L155 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 901#L158 assume !(node3_~m3~0#1 != ~nomsg~0); 903#L158-1 ~mode3~0 := 0; 985#L155-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 997#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 998#L192 assume !(node4_~m4~0#1 != ~nomsg~0); 967#L192-1 ~mode4~0 := 0; 956#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 957#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 894#L226 assume !(node5_~m5~0#1 != ~nomsg~0); 896#L226-1 ~mode5~0 := 0; 947#L223-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 962#L257 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 975#L260 assume !(node6_~m6~0#1 != ~nomsg~0); 969#L260-1 ~mode6~0 := 0; 946#L257-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; 940#L463 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 941#L463-1 check_#res#1 := check_~tmp~1#1; 982#L475 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 899#L564 assume !(0 == assert_~arg#1 % 256); 900#L559 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 950#L531-2 [2022-02-21 04:28:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:49,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2022-02-21 04:28:49,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:49,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276320593] [2022-02-21 04:28:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:49,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:49,782 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 3 times [2022-02-21 04:28:49,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:49,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869198081] [2022-02-21 04:28:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:49,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {1297#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#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; {1297#true} is VALID [2022-02-21 04:28:49,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume !(node1_~m1~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:49,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {1297#true} ~mode1~0 := 0; {1297#true} is VALID [2022-02-21 04:28:49,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {1297#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#true} assume !(node2_~m2~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:49,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#true} ~mode2~0 := 0; {1297#true} is VALID [2022-02-21 04:28:49,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {1297#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {1297#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {1297#true} assume !(node3_~m3~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:49,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {1297#true} ~mode3~0 := 0; {1297#true} is VALID [2022-02-21 04:28:49,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {1297#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {1297#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {1297#true} assume !(node4_~m4~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:49,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {1297#true} ~mode4~0 := 0; {1297#true} is VALID [2022-02-21 04:28:49,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {1297#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {1297#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {1297#true} assume !(node5_~m5~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:49,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#true} ~mode5~0 := 0; {1297#true} is VALID [2022-02-21 04:28:49,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {1297#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {1297#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:49,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {1297#true} assume !(node6_~m6~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:49,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {1297#true} ~mode6~0 := 0; {1297#true} is VALID [2022-02-21 04:28:49,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {1297#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; {1297#true} is VALID [2022-02-21 04:28:49,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {1297#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1299#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:49,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {1299#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {1300#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:49,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {1300#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {1301#(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:49,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {1301#(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); {1298#false} is VALID [2022-02-21 04:28:49,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {1298#false} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {1298#false} is VALID [2022-02-21 04:28:49,851 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:49,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:49,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869198081] [2022-02-21 04:28:49,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869198081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:49,852 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:49,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:49,852 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106774115] [2022-02-21 04:28:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:49,853 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:49,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:49,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:49,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:49,854 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. cyclomatic complexity: 58 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:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:50,175 INFO L93 Difference]: Finished difference Result 142 states and 198 transitions. [2022-02-21 04:28:50,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:50,176 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:50,196 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:50,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 198 transitions. [2022-02-21 04:28:50,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:50,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 194 transitions. [2022-02-21 04:28:50,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-02-21 04:28:50,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-02-21 04:28:50,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 194 transitions. [2022-02-21 04:28:50,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:50,204 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2022-02-21 04:28:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 194 transitions. [2022-02-21 04:28:50,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-21 04:28:50,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:50,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 194 transitions. Second operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:50,207 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 194 transitions. Second operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:50,208 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:50,211 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2022-02-21 04:28:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2022-02-21 04:28:50,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:50,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:50,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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 139 states and 194 transitions. [2022-02-21 04:28:50,212 INFO L87 Difference]: Start difference. First operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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 139 states and 194 transitions. [2022-02-21 04:28:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:50,215 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2022-02-21 04:28:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2022-02-21 04:28:50,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:50,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:50,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:50,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2022-02-21 04:28:50,218 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2022-02-21 04:28:50,219 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2022-02-21 04:28:50,219 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:50,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. [2022-02-21 04:28:50,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:50,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:50,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:50,221 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:50,221 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:50,221 INFO L791 eck$LassoCheckResult]: Stem: 1584#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; 1513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1514#L290 assume 0 == ~r1~0; 1561#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 1562#L292 assume ~id1~0 >= 0; 1575#L293 assume 0 == ~st1~0; 1582#L294 assume ~send1~0 == ~id1~0; 1459#L295 assume 0 == ~mode1~0 % 256; 1460#L296 assume ~id2~0 >= 0; 1502#L297 assume 0 == ~st2~0; 1500#L298 assume ~send2~0 == ~id2~0; 1501#L299 assume 0 == ~mode2~0 % 256; 1511#L300 assume ~id3~0 >= 0; 1549#L301 assume 0 == ~st3~0; 1566#L302 assume ~send3~0 == ~id3~0; 1567#L303 assume 0 == ~mode3~0 % 256; 1578#L304 assume ~id4~0 >= 0; 1543#L305 assume 0 == ~st4~0; 1544#L306 assume ~send4~0 == ~id4~0; 1560#L307 assume 0 == ~mode4~0 % 256; 1467#L308 assume ~id5~0 >= 0; 1468#L309 assume 0 == ~st5~0; 1555#L310 assume ~send5~0 == ~id5~0; 1530#L311 assume 0 == ~mode5~0 % 256; 1531#L312 assume ~id6~0 >= 0; 1488#L313 assume 0 == ~st6~0; 1489#L314 assume ~send6~0 == ~id6~0; 1521#L315 assume 0 == ~mode6~0 % 256; 1522#L316 assume ~id1~0 != ~id2~0; 1457#L317 assume ~id1~0 != ~id3~0; 1458#L318 assume ~id1~0 != ~id4~0; 1585#L319 assume ~id1~0 != ~id5~0; 1565#L320 assume ~id1~0 != ~id6~0; 1545#L321 assume ~id2~0 != ~id3~0; 1546#L322 assume ~id2~0 != ~id4~0; 1450#L323 assume ~id2~0 != ~id5~0; 1451#L324 assume ~id2~0 != ~id6~0; 1477#L325 assume ~id3~0 != ~id4~0; 1497#L326 assume ~id3~0 != ~id5~0; 1484#L327 assume ~id3~0 != ~id6~0; 1485#L328 assume ~id4~0 != ~id5~0; 1507#L329 assume ~id4~0 != ~id6~0; 1508#L330 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 1532#L290-1 init_#res#1 := init_~tmp~0#1; 1452#L455 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 1453#L22 assume !(0 == assume_abort_if_not_~cond#1); 1520#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; 1524#L531-2 [2022-02-21 04:28:50,221 INFO L793 eck$LassoCheckResult]: Loop: 1524#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1583#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; 1576#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 1510#L88-1 ~mode1~0 := 0; 1493#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1494#L121 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1496#L124 assume !(node2_~m2~0#1 != ~nomsg~0); 1512#L124-1 ~mode2~0 := 0; 1461#L121-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1462#L155 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1474#L158 assume !(node3_~m3~0#1 != ~nomsg~0); 1476#L158-1 ~mode3~0 := 0; 1557#L155-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1569#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1570#L192 assume !(node4_~m4~0#1 != ~nomsg~0); 1539#L192-1 ~mode4~0 := 0; 1528#L189-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1529#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1469#L226 assume !(node5_~m5~0#1 != ~nomsg~0); 1471#L226-1 ~mode5~0 := 0; 1519#L223-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1534#L257 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1547#L260 assume !(node6_~m6~0#1 != ~nomsg~0); 1541#L260-1 ~mode6~0 := 0; 1518#L257-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; 1515#L463 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1516#L464 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 1579#L463-1 check_#res#1 := check_~tmp~1#1; 1554#L475 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 1472#L564 assume !(0 == assert_~arg#1 % 256); 1473#L559 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 1524#L531-2 [2022-02-21 04:28:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2022-02-21 04:28:50,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:50,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354481185] [2022-02-21 04:28:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:50,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:50,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:50,278 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 911844111, now seen corresponding path program 1 times [2022-02-21 04:28:50,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:50,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599228042] [2022-02-21 04:28:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:50,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:50,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:50,312 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1786874990, now seen corresponding path program 1 times [2022-02-21 04:28:50,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:50,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082980909] [2022-02-21 04:28:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:50,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {1872#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; {1872#true} is VALID [2022-02-21 04:28:50,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {1872#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1872#true} is VALID [2022-02-21 04:28:50,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {1872#true} assume 0 == ~r1~0; {1872#true} is VALID [2022-02-21 04:28:50,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {1872#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1872#true} is VALID [2022-02-21 04:28:50,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {1872#true} assume ~id1~0 >= 0; {1872#true} is VALID [2022-02-21 04:28:50,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {1872#true} assume 0 == ~st1~0; {1872#true} is VALID [2022-02-21 04:28:50,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {1872#true} assume ~send1~0 == ~id1~0; {1872#true} is VALID [2022-02-21 04:28:50,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {1872#true} assume 0 == ~mode1~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:50,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} 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; {1873#false} is VALID [2022-02-21 04:28:50,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {1873#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:50,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {1873#false} ~mode1~0 := 0; {1873#false} is VALID [2022-02-21 04:28:50,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {1873#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {1873#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {1873#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:50,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {1873#false} ~mode2~0 := 0; {1873#false} is VALID [2022-02-21 04:28:50,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {1873#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {1873#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {1873#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:50,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {1873#false} ~mode3~0 := 0; {1873#false} is VALID [2022-02-21 04:28:50,372 INFO L290 TraceCheckUtils]: 59: Hoare triple {1873#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {1873#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {1873#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:50,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {1873#false} ~mode4~0 := 0; {1873#false} is VALID [2022-02-21 04:28:50,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {1873#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {1873#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {1873#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:50,372 INFO L290 TraceCheckUtils]: 66: Hoare triple {1873#false} ~mode5~0 := 0; {1873#false} is VALID [2022-02-21 04:28:50,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {1873#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {1873#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:50,373 INFO L290 TraceCheckUtils]: 69: Hoare triple {1873#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:50,373 INFO L290 TraceCheckUtils]: 70: Hoare triple {1873#false} ~mode6~0 := 0; {1873#false} is VALID [2022-02-21 04:28:50,373 INFO L290 TraceCheckUtils]: 71: Hoare triple {1873#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; {1873#false} is VALID [2022-02-21 04:28:50,373 INFO L290 TraceCheckUtils]: 72: Hoare triple {1873#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1873#false} is VALID [2022-02-21 04:28:50,373 INFO L290 TraceCheckUtils]: 73: Hoare triple {1873#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {1873#false} is VALID [2022-02-21 04:28:50,374 INFO L290 TraceCheckUtils]: 74: Hoare triple {1873#false} check_#res#1 := check_~tmp~1#1; {1873#false} is VALID [2022-02-21 04:28:50,374 INFO L290 TraceCheckUtils]: 75: Hoare triple {1873#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {1873#false} is VALID [2022-02-21 04:28:50,374 INFO L290 TraceCheckUtils]: 76: Hoare triple {1873#false} assume !(0 == assert_~arg#1 % 256); {1873#false} is VALID [2022-02-21 04:28:50,374 INFO L290 TraceCheckUtils]: 77: Hoare triple {1873#false} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {1873#false} is VALID [2022-02-21 04:28:50,374 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:50,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:50,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082980909] [2022-02-21 04:28:50,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082980909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:50,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:50,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:50,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647348174] [2022-02-21 04:28:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:51,222 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:51,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:51,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:51,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:51,223 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:51,223 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:51,223 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:51,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:51,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-02-21 04:28:51,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:51,223 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:51,237 INFO L141 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:51,243 INFO L141 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:51,245 INFO L141 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:51,248 INFO L141 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:51,249 INFO L141 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:51,251 INFO L141 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:51,254 INFO L141 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:51,264 INFO L141 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:51,268 INFO L141 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:51,270 INFO L141 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:51,272 INFO L141 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:51,274 INFO L141 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:51,276 INFO L141 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:51,279 INFO L141 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:51,281 INFO L141 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:51,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:51,285 INFO L141 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:51,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:51,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:51,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:51,299 INFO L141 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:51,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:51,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:51,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:51,308 INFO L141 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:51,310 INFO L141 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:52,131 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:52,132 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:52,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:52,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:52,135 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:52,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:52,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:52,161 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:52,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:28:52,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:52,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:52,179 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:52,180 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:52,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:52,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:52,292 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:52,296 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:52,296 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:52,296 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:52,296 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:52,296 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:52,296 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:52,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:52,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:52,297 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:52,297 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-02-21 04:28:52,297 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:52,297 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:52,299 INFO L141 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:52,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:52,310 INFO L141 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:52,312 INFO L141 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:52,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:52,317 INFO L141 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:52,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:52,329 INFO L141 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:52,331 INFO L141 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:52,332 INFO L141 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:52,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:52,336 INFO L141 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:52,349 INFO L141 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:52,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:52,419 INFO L141 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:52,421 INFO L141 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:52,425 INFO L141 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:52,430 INFO L141 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:52,432 INFO L141 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:52,434 INFO L141 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:52,436 INFO L141 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:52,444 INFO L141 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:52,445 INFO L141 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:52,457 INFO L141 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:52,459 INFO L141 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:52,461 INFO L141 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:53,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:53,393 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:53,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,396 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:53,397 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:53,399 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:53,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:28:53,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,447 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:53,448 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:53,449 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:53,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,488 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:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,490 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:53,491 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:53,493 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:53,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,533 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:53,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,534 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:53,535 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:53,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:53,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:53,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,569 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:53,570 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:53,571 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:53,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:28:53,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,610 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:53,613 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:53,613 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:53,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,620 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:28:53,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,621 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:28:53,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,648 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:53,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,650 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:53,651 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:53,652 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:53,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,679 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:28:53,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,690 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:28:53,691 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:28:53,692 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:53,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 04:28:53,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,736 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:28:53,737 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:28:53,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:53,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,765 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:28:53,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,766 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:28:53,768 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:28:53,769 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:53,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,804 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:28:53,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,805 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:28:53,806 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:28:53,808 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:53,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:53,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,848 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:28:53,850 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:28:53,850 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:53,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,878 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:28:53,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,879 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:28:53,880 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:28:53,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:53,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,922 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:28:53,923 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:28:53,925 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:53,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 04:28:53,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,958 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:28:53,959 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:28:53,961 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:53,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:53,985 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:28:53,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:53,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:53,987 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:28:53,989 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:28:53,990 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:53,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:53,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:53,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:53,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:53,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:53,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:53,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:53,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:28:54,018 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:28:54,018 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:28:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:54,036 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:28:54,075 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:28:54,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:28:54,076 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:28:54,076 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:28:54,077 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:28:54,093 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:28:54,103 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:28:54,109 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "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;" "assume !(node1_~m1~0#1 != ~nomsg~0);" "~mode1~0 := 0;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#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~ite8#1, node3_#t~ite9#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~ite10#1, node4_#t~ite11#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~ite12#1, node5_#t~ite13#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~ite14#1, node6_#t~ite15#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~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1;" [2022-02-21 04:28:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:54,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:28:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:54,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:54,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {1875#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; {1875#unseeded} is VALID [2022-02-21 04:28:54,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {1875#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1875#unseeded} is VALID [2022-02-21 04:28:54,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {1875#unseeded} assume 0 == ~r1~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {1875#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1875#unseeded} is VALID [2022-02-21 04:28:54,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {1875#unseeded} assume ~id1~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:28:54,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {1875#unseeded} assume 0 == ~st1~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1875#unseeded} assume ~send1~0 == ~id1~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1875#unseeded} assume 0 == ~mode1~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:28:54,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {1875#unseeded} assume ~id2~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:28:54,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {1875#unseeded} assume 0 == ~st2~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {1875#unseeded} assume ~send2~0 == ~id2~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {1875#unseeded} assume 0 == ~mode2~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:28:54,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {1875#unseeded} assume ~id3~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:28:54,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {1875#unseeded} assume 0 == ~st3~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {1875#unseeded} assume ~send3~0 == ~id3~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {1875#unseeded} assume 0 == ~mode3~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:28:54,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {1875#unseeded} assume ~id4~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:28:54,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {1875#unseeded} assume 0 == ~st4~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {1875#unseeded} assume ~send4~0 == ~id4~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {1875#unseeded} assume 0 == ~mode4~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:28:54,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {1875#unseeded} assume ~id5~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:28:54,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {1875#unseeded} assume 0 == ~st5~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {1875#unseeded} assume ~send5~0 == ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {1875#unseeded} assume 0 == ~mode5~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:28:54,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {1875#unseeded} assume ~id6~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:28:54,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {1875#unseeded} assume 0 == ~st6~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {1875#unseeded} assume ~send6~0 == ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {1875#unseeded} assume 0 == ~mode6~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:28:54,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {1875#unseeded} assume ~id1~0 != ~id2~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {1875#unseeded} assume ~id1~0 != ~id3~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {1875#unseeded} assume ~id1~0 != ~id4~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {1875#unseeded} assume ~id1~0 != ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {1875#unseeded} assume ~id1~0 != ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {1875#unseeded} assume ~id2~0 != ~id3~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {1875#unseeded} assume ~id2~0 != ~id4~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {1875#unseeded} assume ~id2~0 != ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {1875#unseeded} assume ~id2~0 != ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {1875#unseeded} assume ~id3~0 != ~id4~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {1875#unseeded} assume ~id3~0 != ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {1875#unseeded} assume ~id3~0 != ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {1875#unseeded} assume ~id4~0 != ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {1875#unseeded} assume ~id4~0 != ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:28:54,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {1875#unseeded} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1875#unseeded} is VALID [2022-02-21 04:28:54,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {1875#unseeded} init_#res#1 := init_~tmp~0#1; {1875#unseeded} is VALID [2022-02-21 04:28:54,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {1875#unseeded} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {1875#unseeded} is VALID [2022-02-21 04:28:54,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {1875#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1875#unseeded} is VALID [2022-02-21 04:28:54,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {1875#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; {1875#unseeded} is VALID [2022-02-21 04:28:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:54,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:28:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:54,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:54,442 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:28:54,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {1878#(>= 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_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} 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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node1_~m1~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode1~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {2031#(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~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {2031#(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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node2_~m2~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode2~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {2031#(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~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {2031#(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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node3_~m3~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode3~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {2031#(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~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {2031#(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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node4_~m4~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode4~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {2031#(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~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {2031#(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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node5_~m5~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode5~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {2031#(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~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {2031#(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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node6_~m6~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode6~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {2031#(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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {2031#(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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {2031#(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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} check_#res#1 := check_~tmp~1#1; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(0 == assert_~arg#1 % 256); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:28:54,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {1888#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:28:54,624 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,625 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:28:54,645 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:28:54,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 47 letters. Loop has 31 letters. [2022-02-21 04:28:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,649 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:28:54,649 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 194 transitions. cyclomatic complexity: 56 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:28:54,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 194 transitions. cyclomatic complexity: 56. 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 231 states and 342 transitions. Complement of second has 4 states. [2022-02-21 04:28:54,886 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:28:54,886 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:54,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. cyclomatic complexity: 56 [2022-02-21 04:28:54,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:54,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:54,886 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:28:54,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:54,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:54,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:54,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 342 transitions. [2022-02-21 04:28:54,895 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:54,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:54,897 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 139 states and 194 transitions. cyclomatic complexity: 56 [2022-02-21 04:28:54,936 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 92 examples of accepted words. [2022-02-21 04:28:54,937 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:28:54,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:54,939 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:28:54,939 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2022-02-21 04:28:54,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2022-02-21 04:28:54,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:54,940 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:28:54,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:28:54,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,941 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:28:54,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:28:54,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:54,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,944 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:28:54,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:54,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 231 letters. Loop has 231 letters. [2022-02-21 04:28:54,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,945 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 231 letters. Loop has 231 letters. [2022-02-21 04:28:54,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 231 letters. Loop has 231 letters. [2022-02-21 04:28:54,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 139 letters. Loop has 139 letters. [2022-02-21 04:28:54,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,945 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 139 letters. Loop has 139 letters. [2022-02-21 04:28:54,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 139 letters. Loop has 139 letters. [2022-02-21 04:28:54,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:54,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,946 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:28:54,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:54,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:28:54,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,948 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:28:54,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:28:54,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:28:54,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,949 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:28:54,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:28:54,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:28:54,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,950 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:28:54,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:28:54,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:28:54,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,951 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:28:54,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:28:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:28:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,952 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:28:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:28:54,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 31 letters. [2022-02-21 04:28:54,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,953 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:28:54,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 31 letters. [2022-02-21 04:28:54,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:28:54,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,954 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:28:54,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:28:54,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 69 letters. Loop has 31 letters. [2022-02-21 04:28:54,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,955 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:28:54,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 31 letters. [2022-02-21 04:28:54,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:28:54,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,956 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:28:54,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:28:54,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:28:54,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,957 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:28:54,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:28:54,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:28:54,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,958 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:28:54,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:28:54,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:28:54,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,959 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:28:54,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:28:54,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:28:54,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,960 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:28:54,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:28:54,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 31 letters. [2022-02-21 04:28:54,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,962 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:28:54,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 75 letters. Loop has 31 letters. [2022-02-21 04:28:54,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:28:54,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,963 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:28:54,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:28:54,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:28:54,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,965 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:28:54,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:28:54,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:28:54,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,966 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:28:54,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:28:54,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:28:54,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,967 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:28:54,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:28:54,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:28:54,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,968 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:28:54,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:28:54,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:28:54,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,969 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:28:54,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:28:54,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:28:54,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,971 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:28:54,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:28:54,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:28:54,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,972 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:28:54,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:28:54,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:28:54,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,973 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:28:54,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:28:54,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:28:54,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,974 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:28:54,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:28:54,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:28:54,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,976 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:28:54,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:28:54,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:28:54,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,978 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:28:54,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:28:54,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:28:54,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,994 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:28:54,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:28:54,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:28:54,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,995 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:28:54,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:28:54,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:28:54,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,997 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:28:54,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:28:54,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:28:54,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,998 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:28:54,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:54,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:28:55,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:28:55,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,004 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:28:55,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:28:55,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:28:55,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,005 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:28:55,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:28:55,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:28:55,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,007 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:28:55,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:28:55,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:28:55,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,008 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:28:55,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:28:55,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:28:55,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,010 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:28:55,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:28:55,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:28:55,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,011 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:28:55,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:28:55,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:28:55,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,012 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:28:55,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:28:55,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:28:55,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,013 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:28:55,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:28:55,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 34 letters. [2022-02-21 04:28:55,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,014 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:28:55,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 34 letters. [2022-02-21 04:28:55,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:28:55,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,015 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:28:55,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:28:55,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:28:55,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,016 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:28:55,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:28:55,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 34 letters. [2022-02-21 04:28:55,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,017 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:28:55,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 34 letters. [2022-02-21 04:28:55,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:28:55,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,018 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:28:55,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:28:55,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:28:55,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,019 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:28:55,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:28:55,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:28:55,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,020 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:28:55,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:28:55,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 65 letters. Loop has 31 letters. [2022-02-21 04:28:55,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,021 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:28:55,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 65 letters. Loop has 31 letters. [2022-02-21 04:28:55,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:28:55,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,022 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:28:55,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:28:55,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 31 letters. [2022-02-21 04:28:55,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,023 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:28:55,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 31 letters. [2022-02-21 04:28:55,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 31 letters. [2022-02-21 04:28:55,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,025 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:28:55,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 76 letters. Loop has 31 letters. [2022-02-21 04:28:55,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 31 letters. [2022-02-21 04:28:55,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,026 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:28:55,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 77 letters. Loop has 31 letters. [2022-02-21 04:28:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:28:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,027 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:28:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:28:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:28:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,028 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:28:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:28:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:28:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,029 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:28:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:28:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:28:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,030 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:28:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:28:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:28:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,031 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:28:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:28:55,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:28:55,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,032 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:28:55,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:28:55,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:28:55,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,033 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:28:55,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:28:55,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 49 letters. Loop has 32 letters. [2022-02-21 04:28:55,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,034 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 32 letters. [2022-02-21 04:28:55,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 49 letters. Loop has 32 letters. [2022-02-21 04:28:55,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:28:55,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,035 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:28:55,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:28:55,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 34 letters. [2022-02-21 04:28:55,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,036 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 34 letters. [2022-02-21 04:28:55,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 34 letters. [2022-02-21 04:28:55,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:28:55,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,037 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:28:55,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:28:55,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:28:55,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,038 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:28:55,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:28:55,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:28:55,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,039 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:28:55,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:28:55,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:28:55,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,041 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:28:55,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:28:55,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:28:55,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,042 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:28:55,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:28:55,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:28:55,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,043 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:28:55,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:28:55,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:28:55,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,044 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:28:55,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:28:55,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:28:55,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,045 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:28:55,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:28:55,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:28:55,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,045 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:28:55,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:28:55,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:28:55,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,046 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:28:55,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:28:55,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:28:55,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,047 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:28:55,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:28:55,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:28:55,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,048 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:28:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:28:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:28:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,049 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:28:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:28:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:28:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,055 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:28:55,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:28:55,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:28:55,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,056 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:28:55,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:28:55,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:28:55,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,057 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:28:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:28:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:28:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,058 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:28:55,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:28:55,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 31 letters. [2022-02-21 04:28:55,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,059 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:28:55,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 31 letters. [2022-02-21 04:28:55,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 31 letters. [2022-02-21 04:28:55,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,060 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:28:55,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 73 letters. Loop has 31 letters. [2022-02-21 04:28:55,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:28:55,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,062 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 32 letters. [2022-02-21 04:28:55,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:28:55,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 31 letters. [2022-02-21 04:28:55,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,064 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:28:55,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 31 letters. [2022-02-21 04:28:55,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 31 letters. [2022-02-21 04:28:55,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,065 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:28:55,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 31 letters. [2022-02-21 04:28:55,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:28:55,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,066 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:28:55,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:28:55,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:28:55,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,067 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:28:55,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:28:55,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:28:55,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,068 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:28:55,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:28:55,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 34 letters. [2022-02-21 04:28:55,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,069 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:28:55,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 34 letters. [2022-02-21 04:28:55,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:28:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,070 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:28:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:28:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 31 letters. [2022-02-21 04:28:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,071 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:28:55,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 31 letters. [2022-02-21 04:28:55,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 31 letters. [2022-02-21 04:28:55,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,073 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:28:55,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 31 letters. [2022-02-21 04:28:55,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:28:55,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,075 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:28:55,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:28:55,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 31 letters. [2022-02-21 04:28:55,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,076 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:28:55,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 31 letters. [2022-02-21 04:28:55,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:28:55,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,077 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:28:55,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:28:55,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:55,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,078 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:28:55,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:55,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,079 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:55,079 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:28:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-21 04:28:55,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:28:55,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 78 letters. Loop has 31 letters. [2022-02-21 04:28:55,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 47 letters. Loop has 62 letters. [2022-02-21 04:28:55,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:55,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2022-02-21 04:28:55,088 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:55,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2022-02-21 04:28:55,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:55,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:55,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:55,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:55,089 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:55,089 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:55,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:55,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:28:55,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:28:55,090 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:28:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:55,091 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:28:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:55,091 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:28:55,141 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:28:55,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:28:55,143 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:55,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:28:55,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:55,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:55,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:55,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:55,143 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:55,144 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:55,144 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:55,144 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:28:55,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:28:55,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:55,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:55,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:28:55 BoogieIcfgContainer [2022-02-21 04:28:55,149 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:28:55,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:28:55,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:28:55,150 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:28:55,150 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:48" (3/4) ... [2022-02-21 04:28:55,152 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:28:55,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:28:55,157 INFO L158 Benchmark]: Toolchain (without parser) took 7976.93ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 59.4MB in the beginning and 89.2MB in the end (delta: -29.8MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-02-21 04:28:55,158 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 46.7MB in the beginning and 46.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:55,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.72ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 59.2MB in the beginning and 78.8MB in the end (delta: -19.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:28:55,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.39ms. Allocated memory is still 111.1MB. Free memory was 78.8MB in the beginning and 74.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:28:55,159 INFO L158 Benchmark]: Boogie Preprocessor took 46.49ms. Allocated memory is still 111.1MB. Free memory was 74.6MB in the beginning and 71.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:28:55,159 INFO L158 Benchmark]: RCFGBuilder took 701.14ms. Allocated memory is still 111.1MB. Free memory was 71.9MB in the beginning and 86.0MB in the end (delta: -14.1MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-02-21 04:28:55,159 INFO L158 Benchmark]: BuchiAutomizer took 6741.89ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 86.0MB in the beginning and 89.2MB in the end (delta: -3.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-02-21 04:28:55,160 INFO L158 Benchmark]: Witness Printer took 2.41ms. Allocated memory is still 161.5MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:55,163 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 46.7MB in the beginning and 46.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.72ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 59.2MB in the beginning and 78.8MB in the end (delta: -19.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.39ms. Allocated memory is still 111.1MB. Free memory was 78.8MB in the beginning and 74.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.49ms. Allocated memory is still 111.1MB. Free memory was 74.6MB in the beginning and 71.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 701.14ms. Allocated memory is still 111.1MB. Free memory was 71.9MB in the beginning and 86.0MB in the end (delta: -14.1MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6741.89ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 86.0MB in the beginning and 89.2MB in the end (delta: -3.1MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Witness Printer took 2.41ms. Allocated memory is still 161.5MB. Free memory is still 89.2MB. 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 6.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 1.8s. 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 139 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 2245 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1382 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 863 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax100 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:28:55,177 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