./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.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.3.ufo.BOUNDED-6.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 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:05,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:05,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:05,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:05,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:05,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:05,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:05,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:05,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:05,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:05,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:05,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:05,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:05,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:05,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:05,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:05,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:05,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:05,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:05,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:05,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:05,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:05,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:05,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:05,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:05,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:05,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:05,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:05,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:05,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:05,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:05,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:05,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:05,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:05,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:05,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:05,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:05,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:05,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:05,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:05,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:05,873 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:05,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:05,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:05,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:05,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:05,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:05,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:05,903 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:05,903 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:05,903 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:05,904 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:05,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:05,905 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:05,905 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:05,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:05,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:05,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:05,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:05,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:05,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:05,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:05,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:05,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:05,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:05,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:05,907 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:05,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:05,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:05,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:05,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:05,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:05,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:05,910 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:05,910 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 -> 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b [2022-02-21 04:28:06,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:06,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:06,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:06,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:06,236 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:06,237 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.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:28:06,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1935ff2cd/aa51535108de4b9b88e70aef2aa04a38/FLAG8e1c39f2c [2022-02-21 04:28:06,821 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:06,822 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:28:06,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1935ff2cd/aa51535108de4b9b88e70aef2aa04a38/FLAG8e1c39f2c [2022-02-21 04:28:07,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1935ff2cd/aa51535108de4b9b88e70aef2aa04a38 [2022-02-21 04:28:07,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:07,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:07,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:07,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:07,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:07,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:07" (1/1) ... [2022-02-21 04:28:07,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487750e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:07, skipping insertion in model container [2022-02-21 04:28:07,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:07" (1/1) ... [2022-02-21 04:28:07,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:07,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:07,541 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.3.ufo.BOUNDED-6.pals.c[6803,6816] [2022-02-21 04:28:07,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:07,557 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:07,614 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.3.ufo.BOUNDED-6.pals.c[6803,6816] [2022-02-21 04:28:07,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:07,632 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:07,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:07 WrapperNode [2022-02-21 04:28:07,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:07,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:07,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:07,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:07,639 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:07" (1/1) ... [2022-02-21 04:28:07,655 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:07" (1/1) ... [2022-02-21 04:28:07,692 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2022-02-21 04:28:07,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:07,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:07,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:07,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:07,701 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:07" (1/1) ... [2022-02-21 04:28:07,702 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:07" (1/1) ... [2022-02-21 04:28:07,712 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:07" (1/1) ... [2022-02-21 04:28:07,712 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:07" (1/1) ... [2022-02-21 04:28:07,719 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:07" (1/1) ... [2022-02-21 04:28:07,729 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:07" (1/1) ... [2022-02-21 04:28:07,731 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:07" (1/1) ... [2022-02-21 04:28:07,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:07,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:07,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:07,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:07,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:07" (1/1) ... [2022-02-21 04:28:07,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:07,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:07,782 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:07,789 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:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:07,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:07,886 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:07,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:08,156 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:08,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:08,162 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:08,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:08 BoogieIcfgContainer [2022-02-21 04:28:08,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:08,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:08,164 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:08,167 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:08,168 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:08,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:07" (1/3) ... [2022-02-21 04:28:08,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b02642d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:08, skipping insertion in model container [2022-02-21 04:28:08,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:08,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:07" (2/3) ... [2022-02-21 04:28:08,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b02642d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:08, skipping insertion in model container [2022-02-21 04:28:08,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:08,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:08" (3/3) ... [2022-02-21 04:28:08,170 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:28:08,203 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:08,203 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:08,204 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:08,204 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:08,204 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:08,204 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:08,204 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:08,204 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:08,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 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:08,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-02-21 04:28:08,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:08,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:08,254 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:08,254 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:08,254 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:08,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 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:08,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-02-21 04:28:08,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:08,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:08,289 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:08,290 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:08,309 INFO L791 eck$LassoCheckResult]: Stem: 56#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(47, 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; 38#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 12#L159true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 37#L159-1true init_#res#1 := init_~tmp~0#1; 22#L228true main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 40#L275true assume 0 == main_~i2~0#1;assume false; 54#L275-2true ~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;main_~i2~0#1 := 0; 17#L283-2true [2022-02-21 04:28:08,318 INFO L793 eck$LassoCheckResult]: Loop: 17#L283-2true assume !!(main_~i2~0#1 < 6);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; 76#L57true 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 6#L61true assume !(node1_~m1~0#1 != ~nomsg~0); 45#L61-1true ~mode1~0 := 0; 62#L57-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; 46#L92true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 25#L95true assume !(node2_~m2~0#1 != ~nomsg~0); 32#L95-1true ~mode2~0 := 0; 72#L92-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; 5#L126true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 51#L129true assume !(node3_~m3~0#1 != ~nomsg~0); 43#L129-1true ~mode3~0 := 0; 73#L126-2true assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 70#L236true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 74#L236-1true check_#res#1 := check_~tmp~1#1; 75#L248true main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; 14#L307true assume !(0 == assert_~arg#1 % 256); 18#L302true assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 17#L283-2true [2022-02-21 04:28:08,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2022-02-21 04:28:08,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:08,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474766059] [2022-02-21 04:28:08,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:08,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:08,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#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(47, 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; {82#true} is VALID [2022-02-21 04:28:08,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {82#true} is VALID [2022-02-21 04:28:08,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {82#true} is VALID [2022-02-21 04:28:08,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#true} init_#res#1 := init_~tmp~0#1; {82#true} is VALID [2022-02-21 04:28:08,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {82#true} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {82#true} is VALID [2022-02-21 04:28:08,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {82#true} assume 0 == main_~i2~0#1;assume false; {83#false} is VALID [2022-02-21 04:28:08,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#false} ~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;main_~i2~0#1 := 0; {83#false} is VALID [2022-02-21 04:28:08,484 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:08,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:08,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474766059] [2022-02-21 04:28:08,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474766059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:08,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:08,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:28:08,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941765401] [2022-02-21 04:28:08,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:08,492 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 1 times [2022-02-21 04:28:08,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:08,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512298960] [2022-02-21 04:28:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:08,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {84#true} assume !!(main_~i2~0#1 < 6);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; {84#true} is VALID [2022-02-21 04:28:08,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {84#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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {84#true} is VALID [2022-02-21 04:28:08,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {84#true} assume !(node1_~m1~0#1 != ~nomsg~0); {84#true} is VALID [2022-02-21 04:28:08,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {84#true} ~mode1~0 := 0; {84#true} is VALID [2022-02-21 04:28:08,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {84#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; {84#true} is VALID [2022-02-21 04:28:08,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {84#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {84#true} is VALID [2022-02-21 04:28:08,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {84#true} assume !(node2_~m2~0#1 != ~nomsg~0); {84#true} is VALID [2022-02-21 04:28:08,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {84#true} ~mode2~0 := 0; {84#true} is VALID [2022-02-21 04:28:08,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#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; {84#true} is VALID [2022-02-21 04:28:08,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {84#true} is VALID [2022-02-21 04:28:08,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {84#true} assume !(node3_~m3~0#1 != ~nomsg~0); {84#true} is VALID [2022-02-21 04:28:08,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {84#true} ~mode3~0 := 0; {84#true} is VALID [2022-02-21 04:28:08,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {84#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {84#true} is VALID [2022-02-21 04:28:08,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {84#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {86#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:08,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {86#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {87#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:08,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {87#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {88#(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:08,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {88#(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); {85#false} is VALID [2022-02-21 04:28:08,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {85#false} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {85#false} is VALID [2022-02-21 04:28:08,706 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:08,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:08,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512298960] [2022-02-21 04:28:08,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512298960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:08,707 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:08,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:08,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386457367] [2022-02-21 04:28:08,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:08,708 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:08,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:08,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 04:28:08,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 04:28:08,733 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 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:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:08,822 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2022-02-21 04:28:08,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:08,824 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:08,831 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:08,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2022-02-21 04:28:08,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:28:08,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 120 transitions. [2022-02-21 04:28:08,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-02-21 04:28:08,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-02-21 04:28:08,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 120 transitions. [2022-02-21 04:28:08,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:08,862 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2022-02-21 04:28:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 120 transitions. [2022-02-21 04:28:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-21 04:28:08,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:08,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states and 120 transitions. Second operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 0 states have call successors, (0), 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:08,882 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states and 120 transitions. Second operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 0 states have call successors, (0), 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:08,884 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 0 states have call successors, (0), 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:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:08,886 INFO L93 Difference]: Finished difference Result 73 states and 120 transitions. [2022-02-21 04:28:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2022-02-21 04:28:08,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:08,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:08,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 0 states have call successors, (0), 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 73 states and 120 transitions. [2022-02-21 04:28:08,889 INFO L87 Difference]: Start difference. First operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 0 states have call successors, (0), 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 73 states and 120 transitions. [2022-02-21 04:28:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:08,891 INFO L93 Difference]: Finished difference Result 73 states and 120 transitions. [2022-02-21 04:28:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2022-02-21 04:28:08,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:08,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:08,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:08,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 0 states have call successors, (0), 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:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2022-02-21 04:28:08,898 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2022-02-21 04:28:08,898 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2022-02-21 04:28:08,898 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:08,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 120 transitions. [2022-02-21 04:28:08,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:28:08,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:08,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:08,910 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:08,910 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:08,910 INFO L791 eck$LassoCheckResult]: Stem: 232#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(47, 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; 215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 187#L159 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 173#L159-1 init_#res#1 := init_~tmp~0#1; 199#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 200#L275 assume !(0 == main_~i2~0#1); 219#L275-2 ~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;main_~i2~0#1 := 0; 195#L283-2 [2022-02-21 04:28:08,910 INFO L793 eck$LassoCheckResult]: Loop: 195#L283-2 assume !!(main_~i2~0#1 < 6);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; 196#L57 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 174#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 176#L61-1 ~mode1~0 := 0; 227#L57-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; 228#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 204#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 184#L95-1 ~mode2~0 := 0; 211#L92-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; 169#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 170#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 221#L129-1 ~mode3~0 := 0; 222#L126-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 236#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 210#L236-1 check_#res#1 := check_~tmp~1#1; 239#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; 189#L307 assume !(0 == assert_~arg#1 % 256); 190#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 195#L283-2 [2022-02-21 04:28:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2022-02-21 04:28:08,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:08,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145176300] [2022-02-21 04:28:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:08,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {389#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(47, 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; {389#true} is VALID [2022-02-21 04:28:08,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {389#true} is VALID [2022-02-21 04:28:08,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {391#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:08,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {392#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:08,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {393#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-21 04:28:08,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {390#false} is VALID [2022-02-21 04:28:08,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#false} ~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;main_~i2~0#1 := 0; {390#false} is VALID [2022-02-21 04:28:08,965 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:08,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:08,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145176300] [2022-02-21 04:28:08,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145176300] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:08,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:08,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:08,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81318584] [2022-02-21 04:28:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:08,971 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 2 times [2022-02-21 04:28:08,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:08,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513859468] [2022-02-21 04:28:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:08,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:09,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#true} assume !!(main_~i2~0#1 < 6);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; {394#true} is VALID [2022-02-21 04:28:09,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {394#true} is VALID [2022-02-21 04:28:09,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} assume !(node1_~m1~0#1 != ~nomsg~0); {394#true} is VALID [2022-02-21 04:28:09,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {394#true} ~mode1~0 := 0; {394#true} is VALID [2022-02-21 04:28:09,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {394#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; {394#true} is VALID [2022-02-21 04:28:09,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {394#true} is VALID [2022-02-21 04:28:09,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {394#true} assume !(node2_~m2~0#1 != ~nomsg~0); {394#true} is VALID [2022-02-21 04:28:09,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#true} ~mode2~0 := 0; {394#true} is VALID [2022-02-21 04:28:09,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#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; {394#true} is VALID [2022-02-21 04:28:09,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {394#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {394#true} is VALID [2022-02-21 04:28:09,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {394#true} assume !(node3_~m3~0#1 != ~nomsg~0); {394#true} is VALID [2022-02-21 04:28:09,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#true} ~mode3~0 := 0; {394#true} is VALID [2022-02-21 04:28:09,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {394#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {394#true} is VALID [2022-02-21 04:28:09,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {396#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:09,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {396#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {397#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:09,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {398#(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:09,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {398#(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); {395#false} is VALID [2022-02-21 04:28:09,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#false} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {395#false} is VALID [2022-02-21 04:28:09,048 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:09,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:09,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513859468] [2022-02-21 04:28:09,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513859468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:09,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:09,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:09,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301349405] [2022-02-21 04:28:09,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:09,049 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:09,050 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:09,051 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. cyclomatic complexity: 48 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:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:09,374 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2022-02-21 04:28:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:28:09,374 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:09,381 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:09,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 202 transitions. [2022-02-21 04:28:09,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:28:09,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 183 transitions. [2022-02-21 04:28:09,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2022-02-21 04:28:09,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2022-02-21 04:28:09,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 183 transitions. [2022-02-21 04:28:09,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:09,390 INFO L681 BuchiCegarLoop]: Abstraction has 123 states and 183 transitions. [2022-02-21 04:28:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 183 transitions. [2022-02-21 04:28:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2022-02-21 04:28:09,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:09,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states and 183 transitions. Second operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 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:09,394 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states and 183 transitions. Second operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 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:09,394 INFO L87 Difference]: Start difference. First operand 123 states and 183 transitions. Second operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 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:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:09,397 INFO L93 Difference]: Finished difference Result 123 states and 183 transitions. [2022-02-21 04:28:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 183 transitions. [2022-02-21 04:28:09,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:09,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:09,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 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 123 states and 183 transitions. [2022-02-21 04:28:09,399 INFO L87 Difference]: Start difference. First operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 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 123 states and 183 transitions. [2022-02-21 04:28:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:09,402 INFO L93 Difference]: Finished difference Result 123 states and 183 transitions. [2022-02-21 04:28:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 183 transitions. [2022-02-21 04:28:09,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:09,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:09,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:09,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 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:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2022-02-21 04:28:09,406 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2022-02-21 04:28:09,406 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2022-02-21 04:28:09,406 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:09,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 103 transitions. [2022-02-21 04:28:09,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:28:09,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:09,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:09,408 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] [2022-02-21 04:28:09,408 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:09,409 INFO L791 eck$LassoCheckResult]: Stem: 594#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(47, 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; 577#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 549#L159 assume 0 == ~r1~0; 550#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 555#L161 assume ~id1~0 >= 0; 556#L162 assume 0 == ~st1~0; 574#L163 assume ~send1~0 == ~id1~0; 560#L164 assume 0 == ~mode1~0 % 256; 553#L165 assume ~id2~0 >= 0; 554#L166 assume 0 == ~st2~0; 565#L167 assume ~send2~0 == ~id2~0; 543#L168 assume 0 == ~mode2~0 % 256; 544#L169 assume ~id3~0 >= 0; 597#L170 assume 0 == ~st3~0; 582#L171 assume ~send3~0 == ~id3~0; 578#L172 assume 0 == ~mode3~0 % 256; 579#L173 assume ~id1~0 != ~id2~0; 596#L174 assume ~id1~0 != ~id3~0; 534#L175 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 535#L159-1 init_#res#1 := init_~tmp~0#1; 561#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 562#L275 assume !(0 == main_~i2~0#1); 580#L275-2 ~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;main_~i2~0#1 := 0; 557#L283-2 [2022-02-21 04:28:09,409 INFO L793 eck$LassoCheckResult]: Loop: 557#L283-2 assume !!(main_~i2~0#1 < 6);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; 558#L57 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 536#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 538#L61-1 ~mode1~0 := 0; 589#L57-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; 590#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 566#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 546#L95-1 ~mode2~0 := 0; 573#L92-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; 531#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 532#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 583#L129-1 ~mode3~0 := 0; 584#L126-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 598#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 572#L236-1 check_#res#1 := check_~tmp~1#1; 601#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; 551#L307 assume !(0 == assert_~arg#1 % 256); 552#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 557#L283-2 [2022-02-21 04:28:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:09,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2022-02-21 04:28:09,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:09,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499592185] [2022-02-21 04:28:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:09,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:09,458 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 3 times [2022-02-21 04:28:09,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:09,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974680808] [2022-02-21 04:28:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:09,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#true} assume !!(main_~i2~0#1 < 6);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; {853#true} is VALID [2022-02-21 04:28:09,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {853#true} is VALID [2022-02-21 04:28:09,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume !(node1_~m1~0#1 != ~nomsg~0); {853#true} is VALID [2022-02-21 04:28:09,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#true} ~mode1~0 := 0; {853#true} is VALID [2022-02-21 04:28:09,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {853#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; {853#true} is VALID [2022-02-21 04:28:09,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {853#true} is VALID [2022-02-21 04:28:09,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#true} assume !(node2_~m2~0#1 != ~nomsg~0); {853#true} is VALID [2022-02-21 04:28:09,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} ~mode2~0 := 0; {853#true} is VALID [2022-02-21 04:28:09,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#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; {853#true} is VALID [2022-02-21 04:28:09,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {853#true} is VALID [2022-02-21 04:28:09,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#true} assume !(node3_~m3~0#1 != ~nomsg~0); {853#true} is VALID [2022-02-21 04:28:09,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#true} ~mode3~0 := 0; {853#true} is VALID [2022-02-21 04:28:09,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {853#true} is VALID [2022-02-21 04:28:09,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {855#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:09,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {856#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:09,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {856#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {857#(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:09,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#(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); {854#false} is VALID [2022-02-21 04:28:09,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {854#false} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {854#false} is VALID [2022-02-21 04:28:09,540 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:09,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:09,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974680808] [2022-02-21 04:28:09,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974680808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:09,540 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:09,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:09,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384172125] [2022-02-21 04:28:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:09,541 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:09,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:09,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:09,542 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:09,773 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-02-21 04:28:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:09,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:09,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:09,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 105 transitions. [2022-02-21 04:28:09,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:28:09,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 101 transitions. [2022-02-21 04:28:09,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-02-21 04:28:09,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-02-21 04:28:09,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 101 transitions. [2022-02-21 04:28:09,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:09,793 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-02-21 04:28:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 101 transitions. [2022-02-21 04:28:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-21 04:28:09,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:09,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states and 101 transitions. Second operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 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:09,796 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states and 101 transitions. Second operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 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:09,796 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 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:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:09,797 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2022-02-21 04:28:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-02-21 04:28:09,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:09,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:09,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 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 73 states and 101 transitions. [2022-02-21 04:28:09,798 INFO L87 Difference]: Start difference. First operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 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 73 states and 101 transitions. [2022-02-21 04:28:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:09,800 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2022-02-21 04:28:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-02-21 04:28:09,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:09,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:09,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:09,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 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:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2022-02-21 04:28:09,802 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-02-21 04:28:09,802 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-02-21 04:28:09,802 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:09,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2022-02-21 04:28:09,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:28:09,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:09,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:09,804 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] [2022-02-21 04:28:09,804 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] [2022-02-21 04:28:09,804 INFO L791 eck$LassoCheckResult]: Stem: 1003#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(47, 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; 986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 958#L159 assume 0 == ~r1~0; 959#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 964#L161 assume ~id1~0 >= 0; 965#L162 assume 0 == ~st1~0; 983#L163 assume ~send1~0 == ~id1~0; 969#L164 assume 0 == ~mode1~0 % 256; 962#L165 assume ~id2~0 >= 0; 963#L166 assume 0 == ~st2~0; 974#L167 assume ~send2~0 == ~id2~0; 952#L168 assume 0 == ~mode2~0 % 256; 953#L169 assume ~id3~0 >= 0; 1006#L170 assume 0 == ~st3~0; 991#L171 assume ~send3~0 == ~id3~0; 987#L172 assume 0 == ~mode3~0 % 256; 988#L173 assume ~id1~0 != ~id2~0; 1005#L174 assume ~id1~0 != ~id3~0; 943#L175 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 944#L159-1 init_#res#1 := init_~tmp~0#1; 970#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 971#L275 assume !(0 == main_~i2~0#1); 990#L275-2 ~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;main_~i2~0#1 := 0; 966#L283-2 [2022-02-21 04:28:09,804 INFO L793 eck$LassoCheckResult]: Loop: 966#L283-2 assume !!(main_~i2~0#1 < 6);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; 967#L57 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 945#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 947#L61-1 ~mode1~0 := 0; 999#L57-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; 996#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 975#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 955#L95-1 ~mode2~0 := 0; 982#L92-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; 940#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 941#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 992#L129-1 ~mode3~0 := 0; 993#L126-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1007#L236 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 984#L237 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 981#L236-1 check_#res#1 := check_~tmp~1#1; 1010#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; 960#L307 assume !(0 == assert_~arg#1 % 256); 961#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 966#L283-2 [2022-02-21 04:28:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2022-02-21 04:28:09,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:09,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995327296] [2022-02-21 04:28:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:09,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:09,834 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1995544096, now seen corresponding path program 1 times [2022-02-21 04:28:09,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:09,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061845446] [2022-02-21 04:28:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:09,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:09,861 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:09,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash 964547683, now seen corresponding path program 1 times [2022-02-21 04:28:09,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:09,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871143667] [2022-02-21 04:28:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:09,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {1164#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(47, 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; {1164#true} is VALID [2022-02-21 04:28:09,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {1164#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1164#true} is VALID [2022-02-21 04:28:09,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1164#true} assume 0 == ~r1~0; {1164#true} is VALID [2022-02-21 04:28:09,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {1164#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1164#true} is VALID [2022-02-21 04:28:09,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {1164#true} assume ~id1~0 >= 0; {1164#true} is VALID [2022-02-21 04:28:09,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {1164#true} assume 0 == ~st1~0; {1164#true} is VALID [2022-02-21 04:28:09,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {1164#true} assume ~send1~0 == ~id1~0; {1164#true} is VALID [2022-02-21 04:28:09,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {1164#true} assume 0 == ~mode1~0 % 256; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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;main_~i2~0#1 := 0; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);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; {1166#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:09,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#(= (+ (* (- 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1165#false} is VALID [2022-02-21 04:28:09,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1165#false} is VALID [2022-02-21 04:28:09,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#false} ~mode1~0 := 0; {1165#false} is VALID [2022-02-21 04:28:09,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {1165#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; {1165#false} is VALID [2022-02-21 04:28:09,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {1165#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1165#false} is VALID [2022-02-21 04:28:09,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {1165#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1165#false} is VALID [2022-02-21 04:28:09,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {1165#false} ~mode2~0 := 0; {1165#false} is VALID [2022-02-21 04:28:09,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {1165#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; {1165#false} is VALID [2022-02-21 04:28:09,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {1165#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1165#false} is VALID [2022-02-21 04:28:09,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {1165#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1165#false} is VALID [2022-02-21 04:28:09,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {1165#false} ~mode3~0 := 0; {1165#false} is VALID [2022-02-21 04:28:09,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {1165#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1165#false} is VALID [2022-02-21 04:28:09,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {1165#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1165#false} is VALID [2022-02-21 04:28:09,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {1165#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1165#false} is VALID [2022-02-21 04:28:09,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {1165#false} check_#res#1 := check_~tmp~1#1; {1165#false} is VALID [2022-02-21 04:28:09,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {1165#false} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {1165#false} is VALID [2022-02-21 04:28:09,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {1165#false} assume !(0 == assert_~arg#1 % 256); {1165#false} is VALID [2022-02-21 04:28:09,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {1165#false} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {1165#false} is VALID [2022-02-21 04:28:09,918 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:09,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:09,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871143667] [2022-02-21 04:28:09,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871143667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:09,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:09,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:09,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554360450] [2022-02-21 04:28:09,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:10,378 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:10,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:10,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:10,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:10,379 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:10,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:10,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:10,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:10,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:28:10,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:10,380 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:10,395 INFO L141 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:10,402 INFO L141 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:10,406 INFO L141 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:10,408 INFO L141 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:10,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:10,414 INFO L141 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:10,416 INFO L141 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:10,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:10,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:10,423 INFO L141 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:10,427 INFO L141 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:10,429 INFO L141 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:10,439 INFO L141 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:10,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:10,446 INFO L141 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:10,448 INFO L141 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:10,463 INFO L141 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:10,963 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:10,963 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:10,973 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:10,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:10,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:10,999 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:11,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:11,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:11,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:11,028 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:11,029 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:11,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:11,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:11,196 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:11,202 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:11,203 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:11,203 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:11,203 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:11,203 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:11,203 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:11,203 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:11,203 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:11,203 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:11,204 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:28:11,204 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:11,204 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:11,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:11,210 INFO L141 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:11,215 INFO L141 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:11,217 INFO L141 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:11,221 INFO L141 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:11,223 INFO L141 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:11,247 INFO L141 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:11,250 INFO L141 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:11,253 INFO L141 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:11,258 INFO L141 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:11,260 INFO L141 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:11,271 INFO L141 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:11,273 INFO L141 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:11,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:11,283 INFO L141 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:11,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:11,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:11,800 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:11,803 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:11,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:11,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:11,813 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:11,829 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:11,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:11,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:11,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:11,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:11,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:11,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:11,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:11,841 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:11,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:11,866 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:11,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:11,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:11,868 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:11,869 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:11,870 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:11,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:11,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:11,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:11,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:11,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:11,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:11,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:11,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:11,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:28:11,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:11,965 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:11,983 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:11,985 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:11,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:11,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:11,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:11,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:11,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:11,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:11,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:11,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:12,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:28:12,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:12,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:12,021 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:12,022 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:12,023 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:12,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:12,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:12,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:12,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:12,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:12,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:12,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:12,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:28:12,093 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:28:12,093 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:28:12,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:12,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:12,114 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:12,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:28:12,127 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:28:12,127 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:28:12,127 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-02-21 04:28:12,128 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:12,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 04:28:12,163 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:28:12,168 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 6);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 := ~p3_old~0;~p3_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;~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;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 <= 1;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1;" [2022-02-21 04:28:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:12,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:28:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:12,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:12,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {1167#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(47, 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; {1167#unseeded} is VALID [2022-02-21 04:28:12,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#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~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1167#unseeded} is VALID [2022-02-21 04:28:12,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#unseeded} assume 0 == ~r1~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {1167#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1167#unseeded} is VALID [2022-02-21 04:28:12,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {1167#unseeded} assume ~id1~0 >= 0; {1167#unseeded} is VALID [2022-02-21 04:28:12,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#unseeded} assume 0 == ~st1~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {1167#unseeded} assume ~send1~0 == ~id1~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#unseeded} assume 0 == ~mode1~0 % 256; {1167#unseeded} is VALID [2022-02-21 04:28:12,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#unseeded} assume ~id2~0 >= 0; {1167#unseeded} is VALID [2022-02-21 04:28:12,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {1167#unseeded} assume 0 == ~st2~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {1167#unseeded} assume ~send2~0 == ~id2~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {1167#unseeded} assume 0 == ~mode2~0 % 256; {1167#unseeded} is VALID [2022-02-21 04:28:12,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#unseeded} assume ~id3~0 >= 0; {1167#unseeded} is VALID [2022-02-21 04:28:12,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {1167#unseeded} assume 0 == ~st3~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {1167#unseeded} assume ~send3~0 == ~id3~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {1167#unseeded} assume 0 == ~mode3~0 % 256; {1167#unseeded} is VALID [2022-02-21 04:28:12,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {1167#unseeded} assume ~id1~0 != ~id2~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {1167#unseeded} assume ~id1~0 != ~id3~0; {1167#unseeded} is VALID [2022-02-21 04:28:12,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {1167#unseeded} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {1167#unseeded} is VALID [2022-02-21 04:28:12,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1167#unseeded} init_#res#1 := init_~tmp~0#1; {1167#unseeded} is VALID [2022-02-21 04:28:12,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {1167#unseeded} main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {1167#unseeded} is VALID [2022-02-21 04:28:12,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {1167#unseeded} assume !(0 == main_~i2~0#1); {1167#unseeded} is VALID [2022-02-21 04:28:12,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {1167#unseeded} ~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;main_~i2~0#1 := 0; {1167#unseeded} is VALID [2022-02-21 04:28:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:12,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:28:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:12,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:12,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:12,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {1170#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))} assume !!(main_~i2~0#1 < 6);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; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(node1_~m1~0#1 != ~nomsg~0); {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode1~0 := 0; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} 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; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(node2_~m2~0#1 != ~nomsg~0); {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode2~0 := 0; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} 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; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(node3_~m3~0#1 != ~nomsg~0); {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode3~0 := 0; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} check_#res#1 := check_~tmp~1#1; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#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; {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 == assert_~arg#1 % 256); {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:28:12,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {1251#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; {1180#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))))} is VALID [2022-02-21 04:28:12,565 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:12,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:12,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:12,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 19 letters. [2022-02-21 04:28:12,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,583 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:12,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:12,705 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 123 states and 180 transitions. Complement of second has 4 states. [2022-02-21 04:28:12,705 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:12,705 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:12,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. cyclomatic complexity: 29 [2022-02-21 04:28:12,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:12,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:12,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:12,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:12,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:12,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:12,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 180 transitions. [2022-02-21 04:28:12,711 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:12,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:12,713 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 73 states and 101 transitions. cyclomatic complexity: 29 [2022-02-21 04:28:12,732 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:28:12,732 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:12,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:12,733 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:28:12,733 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 123 states and 180 transitions. cyclomatic complexity: 58 [2022-02-21 04:28:12,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 180 transitions. cyclomatic complexity: 58 [2022-02-21 04:28:12,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:12,734 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:28:12,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 23 letters. Loop has 19 letters. [2022-02-21 04:28:12,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 19 letters. [2022-02-21 04:28:12,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 23 letters. Loop has 19 letters. [2022-02-21 04:28:12,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:12,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:12,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:12,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 123 letters. Loop has 123 letters. [2022-02-21 04:28:12,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 123 letters. Loop has 123 letters. [2022-02-21 04:28:12,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 123 letters. Loop has 123 letters. [2022-02-21 04:28:12,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:28:12,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 73 letters. [2022-02-21 04:28:12,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:28:12,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:12,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:12,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:12,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 30 letters. Loop has 21 letters. [2022-02-21 04:28:12,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 21 letters. [2022-02-21 04:28:12,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 30 letters. Loop has 21 letters. [2022-02-21 04:28:12,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 31 letters. Loop has 21 letters. [2022-02-21 04:28:12,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 21 letters. [2022-02-21 04:28:12,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 31 letters. Loop has 21 letters. [2022-02-21 04:28:12,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 32 letters. Loop has 19 letters. [2022-02-21 04:28:12,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 19 letters. [2022-02-21 04:28:12,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 32 letters. Loop has 19 letters. [2022-02-21 04:28:12,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 33 letters. Loop has 19 letters. [2022-02-21 04:28:12,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 19 letters. [2022-02-21 04:28:12,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 33 letters. Loop has 19 letters. [2022-02-21 04:28:12,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 33 letters. Loop has 20 letters. [2022-02-21 04:28:12,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 20 letters. [2022-02-21 04:28:12,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 33 letters. Loop has 20 letters. [2022-02-21 04:28:12,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 25 letters. Loop has 19 letters. [2022-02-21 04:28:12,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 19 letters. [2022-02-21 04:28:12,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 25 letters. Loop has 19 letters. [2022-02-21 04:28:12,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 26 letters. Loop has 20 letters. [2022-02-21 04:28:12,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 20 letters. [2022-02-21 04:28:12,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 26 letters. Loop has 20 letters. [2022-02-21 04:28:12,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 26 letters. Loop has 19 letters. [2022-02-21 04:28:12,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 19 letters. [2022-02-21 04:28:12,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 26 letters. Loop has 19 letters. [2022-02-21 04:28:12,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 27 letters. Loop has 21 letters. [2022-02-21 04:28:12,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 21 letters. [2022-02-21 04:28:12,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 27 letters. Loop has 21 letters. [2022-02-21 04:28:12,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 28 letters. Loop has 22 letters. [2022-02-21 04:28:12,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 22 letters. [2022-02-21 04:28:12,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 28 letters. Loop has 22 letters. [2022-02-21 04:28:12,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 35 letters. Loop has 21 letters. [2022-02-21 04:28:12,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 21 letters. [2022-02-21 04:28:12,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 35 letters. Loop has 21 letters. [2022-02-21 04:28:12,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 35 letters. Loop has 20 letters. [2022-02-21 04:28:12,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 20 letters. [2022-02-21 04:28:12,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 35 letters. Loop has 20 letters. [2022-02-21 04:28:12,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 31 letters. Loop has 21 letters. [2022-02-21 04:28:12,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 21 letters. [2022-02-21 04:28:12,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 31 letters. Loop has 21 letters. [2022-02-21 04:28:12,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 30 letters. Loop has 19 letters. [2022-02-21 04:28:12,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 19 letters. [2022-02-21 04:28:12,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 30 letters. Loop has 19 letters. [2022-02-21 04:28:12,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 32 letters. Loop has 22 letters. [2022-02-21 04:28:12,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 22 letters. [2022-02-21 04:28:12,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 32 letters. Loop has 22 letters. [2022-02-21 04:28:12,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 34 letters. Loop has 21 letters. [2022-02-21 04:28:12,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 21 letters. [2022-02-21 04:28:12,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 34 letters. Loop has 21 letters. [2022-02-21 04:28:12,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:28:12,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:28:12,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:28:12,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 41 letters. Loop has 19 letters. [2022-02-21 04:28:12,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 19 letters. [2022-02-21 04:28:12,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 41 letters. Loop has 19 letters. [2022-02-21 04:28:12,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 23 letters. Loop has 19 letters. [2022-02-21 04:28:12,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 19 letters. [2022-02-21 04:28:12,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 23 letters. Loop has 19 letters. [2022-02-21 04:28:12,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 24 letters. Loop has 19 letters. [2022-02-21 04:28:12,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 19 letters. [2022-02-21 04:28:12,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 24 letters. Loop has 19 letters. [2022-02-21 04:28:12,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 36 letters. Loop has 22 letters. [2022-02-21 04:28:12,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 22 letters. [2022-02-21 04:28:12,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 36 letters. Loop has 22 letters. [2022-02-21 04:28:12,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 34 letters. Loop has 20 letters. [2022-02-21 04:28:12,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 20 letters. [2022-02-21 04:28:12,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 34 letters. Loop has 20 letters. [2022-02-21 04:28:12,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 35 letters. Loop has 22 letters. [2022-02-21 04:28:12,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 22 letters. [2022-02-21 04:28:12,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 35 letters. Loop has 22 letters. [2022-02-21 04:28:12,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 29 letters. Loop has 19 letters. [2022-02-21 04:28:12,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 19 letters. [2022-02-21 04:28:12,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 29 letters. Loop has 19 letters. [2022-02-21 04:28:12,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 30 letters. Loop has 20 letters. [2022-02-21 04:28:12,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 20 letters. [2022-02-21 04:28:12,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 30 letters. Loop has 20 letters. [2022-02-21 04:28:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 26 letters. Loop has 20 letters. [2022-02-21 04:28:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 20 letters. [2022-02-21 04:28:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 26 letters. Loop has 20 letters. [2022-02-21 04:28:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 27 letters. Loop has 20 letters. [2022-02-21 04:28:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 20 letters. [2022-02-21 04:28:12,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 27 letters. Loop has 20 letters. [2022-02-21 04:28:12,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 27 letters. Loop has 22 letters. [2022-02-21 04:28:12,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 22 letters. [2022-02-21 04:28:12,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 27 letters. Loop has 22 letters. [2022-02-21 04:28:12,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 38 letters. Loop has 20 letters. [2022-02-21 04:28:12,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 20 letters. [2022-02-21 04:28:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 38 letters. Loop has 20 letters. [2022-02-21 04:28:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 38 letters. Loop has 19 letters. [2022-02-21 04:28:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 19 letters. [2022-02-21 04:28:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 38 letters. Loop has 19 letters. [2022-02-21 04:28:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 31 letters. Loop has 19 letters. [2022-02-21 04:28:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 19 letters. [2022-02-21 04:28:12,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 31 letters. Loop has 19 letters. [2022-02-21 04:28:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 37 letters. Loop has 19 letters. [2022-02-21 04:28:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 19 letters. [2022-02-21 04:28:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 37 letters. Loop has 19 letters. [2022-02-21 04:28:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 28 letters. Loop has 22 letters. [2022-02-21 04:28:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 22 letters. [2022-02-21 04:28:12,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 28 letters. Loop has 22 letters. [2022-02-21 04:28:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 31 letters. Loop has 20 letters. [2022-02-21 04:28:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 20 letters. [2022-02-21 04:28:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 31 letters. Loop has 20 letters. [2022-02-21 04:28:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 34 letters. Loop has 19 letters. [2022-02-21 04:28:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 19 letters. [2022-02-21 04:28:12,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 34 letters. Loop has 19 letters. [2022-02-21 04:28:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 35 letters. Loop has 19 letters. [2022-02-21 04:28:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 19 letters. [2022-02-21 04:28:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 35 letters. Loop has 19 letters. [2022-02-21 04:28:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 29 letters. Loop has 20 letters. [2022-02-21 04:28:12,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 20 letters. [2022-02-21 04:28:12,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 29 letters. Loop has 20 letters. [2022-02-21 04:28:12,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 30 letters. Loop has 20 letters. [2022-02-21 04:28:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 20 letters. [2022-02-21 04:28:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 30 letters. Loop has 20 letters. [2022-02-21 04:28:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 28 letters. Loop has 19 letters. [2022-02-21 04:28:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 19 letters. [2022-02-21 04:28:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 28 letters. Loop has 19 letters. [2022-02-21 04:28:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 35 letters. Loop has 21 letters. [2022-02-21 04:28:12,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 21 letters. [2022-02-21 04:28:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 35 letters. Loop has 21 letters. [2022-02-21 04:28:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 36 letters. Loop has 22 letters. [2022-02-21 04:28:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 22 letters. [2022-02-21 04:28:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 36 letters. Loop has 22 letters. [2022-02-21 04:28:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 27 letters. Loop has 19 letters. [2022-02-21 04:28:12,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 19 letters. [2022-02-21 04:28:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 27 letters. Loop has 19 letters. [2022-02-21 04:28:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 31 letters. Loop has 22 letters. [2022-02-21 04:28:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 22 letters. [2022-02-21 04:28:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 31 letters. Loop has 22 letters. [2022-02-21 04:28:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 32 letters. Loop has 22 letters. [2022-02-21 04:28:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 22 letters. [2022-02-21 04:28:12,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 32 letters. Loop has 22 letters. [2022-02-21 04:28:12,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 34 letters. Loop has 20 letters. [2022-02-21 04:28:12,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 20 letters. [2022-02-21 04:28:12,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 34 letters. Loop has 20 letters. [2022-02-21 04:28:12,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 27 letters. Loop has 21 letters. [2022-02-21 04:28:12,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 21 letters. [2022-02-21 04:28:12,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 27 letters. Loop has 21 letters. [2022-02-21 04:28:12,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 36 letters. Loop has 19 letters. [2022-02-21 04:28:12,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 19 letters. [2022-02-21 04:28:12,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 36 letters. Loop has 19 letters. [2022-02-21 04:28:12,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 25 letters. Loop has 20 letters. [2022-02-21 04:28:12,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 20 letters. [2022-02-21 04:28:12,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 25 letters. Loop has 20 letters. [2022-02-21 04:28:12,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 26 letters. Loop has 21 letters. [2022-02-21 04:28:12,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 21 letters. [2022-02-21 04:28:12,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 26 letters. Loop has 21 letters. [2022-02-21 04:28:12,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 39 letters. Loop has 19 letters. [2022-02-21 04:28:12,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 19 letters. [2022-02-21 04:28:12,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 39 letters. Loop has 19 letters. [2022-02-21 04:28:12,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 101 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:12,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:12,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 180 transitions. cyclomatic complexity: 58 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:12,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,770 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-02-21 04:28:12,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 19 letters. [2022-02-21 04:28:12,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 42 letters. Loop has 19 letters. [2022-02-21 04:28:12,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 38 letters. [2022-02-21 04:28:12,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:12,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. cyclomatic complexity: 58 [2022-02-21 04:28:12,776 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:12,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2022-02-21 04:28:12,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:12,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:12,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:12,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:12,776 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:12,776 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:12,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:28:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:28:12,777 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:12,777 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:28:12,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:12,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:12,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:12,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:28:12,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:12,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:28:12,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:12,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:12,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:12,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:12,808 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:12,808 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:12,808 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:12,808 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:28:12,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:28:12,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:12,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:12,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:28:12 BoogieIcfgContainer [2022-02-21 04:28:12,815 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:28:12,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:28:12,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:28:12,816 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:28:12,816 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:08" (3/4) ... [2022-02-21 04:28:12,818 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:28:12,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:28:12,824 INFO L158 Benchmark]: Toolchain (without parser) took 5606.31ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 91.2MB in the beginning and 76.7MB in the end (delta: 14.5MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2022-02-21 04:28:12,824 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 119.5MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:12,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.60ms. Allocated memory is still 119.5MB. Free memory was 91.0MB in the beginning and 89.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:28:12,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.76ms. Allocated memory is still 119.5MB. Free memory was 89.2MB in the beginning and 86.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:28:12,825 INFO L158 Benchmark]: Boogie Preprocessor took 43.80ms. Allocated memory is still 119.5MB. Free memory was 86.5MB in the beginning and 84.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:12,825 INFO L158 Benchmark]: RCFGBuilder took 425.79ms. Allocated memory is still 119.5MB. Free memory was 84.7MB in the beginning and 66.0MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 04:28:12,829 INFO L158 Benchmark]: BuchiAutomizer took 4650.62ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 65.8MB in the beginning and 77.7MB in the end (delta: -11.9MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2022-02-21 04:28:12,829 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 174.1MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:12,832 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.21ms. Allocated memory is still 119.5MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.60ms. Allocated memory is still 119.5MB. Free memory was 91.0MB in the beginning and 89.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.76ms. Allocated memory is still 119.5MB. Free memory was 89.2MB in the beginning and 86.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.80ms. Allocated memory is still 119.5MB. Free memory was 86.5MB in the beginning and 84.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 425.79ms. Allocated memory is still 119.5MB. Free memory was 84.7MB in the beginning and 66.0MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4650.62ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 65.8MB in the beginning and 77.7MB in the end (delta: -11.9MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 174.1MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 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 4.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 73 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 1140 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 699 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 441 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp30 ukn100 mio100 lsp100 div171 bol100 ite100 ukn100 eq152 hnf97 smp76 dnf105 smp94 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:28:12,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE