./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.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.7.1.ufo.BOUNDED-14.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 252cd4a0f8e1adbe16c63dba2a525d461eb83ddbfd931d93e6b7ef83b52daaf7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:30:17,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:30:17,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:30:17,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:30:17,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:30:17,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:30:17,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:30:17,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:30:17,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:30:17,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:30:17,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:30:17,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:30:17,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:30:17,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:30:17,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:30:17,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:30:17,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:30:17,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:30:17,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:30:17,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:30:17,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:30:17,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:30:17,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:30:17,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:30:17,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:30:17,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:30:17,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:30:17,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:30:17,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:30:17,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:30:17,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:30:17,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:30:17,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:30:17,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:30:17,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:30:17,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:30:17,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:30:17,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:30:17,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:30:17,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:30:17,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:30:17,888 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:30:17,909 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:30:17,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:30:17,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:30:17,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:30:17,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:30:17,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:30:17,911 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:30:17,911 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:30:17,912 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:30:17,912 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:30:17,912 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:30:17,912 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:30:17,913 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:30:17,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:30:17,913 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:30:17,913 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:30:17,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:30:17,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:30:17,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:30:17,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:30:17,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:30:17,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:30:17,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:30:17,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:30:17,915 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:30:17,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:30:17,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:30:17,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:30:17,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:30:17,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:30:17,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:30:17,917 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:30:17,917 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 -> 252cd4a0f8e1adbe16c63dba2a525d461eb83ddbfd931d93e6b7ef83b52daaf7 [2022-02-21 04:30:18,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:30:18,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:30:18,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:30:18,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:30:18,110 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:30:18,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2022-02-21 04:30:18,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2aef1f5/f7db8b23db3c42719a98cb26e492393a/FLAG4c594cdec [2022-02-21 04:30:18,549 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:30:18,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2022-02-21 04:30:18,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2aef1f5/f7db8b23db3c42719a98cb26e492393a/FLAG4c594cdec [2022-02-21 04:30:18,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2aef1f5/f7db8b23db3c42719a98cb26e492393a [2022-02-21 04:30:18,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:30:18,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:30:18,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:18,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:30:18,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:30:18,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9e2fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18, skipping insertion in model container [2022-02-21 04:30:18,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:30:18,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:30:18,773 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.7.1.ufo.BOUNDED-14.pals.c[20056,20069] [2022-02-21 04:30:18,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:18,780 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:30:18,836 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.7.1.ufo.BOUNDED-14.pals.c[20056,20069] [2022-02-21 04:30:18,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:30:18,847 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:30:18,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18 WrapperNode [2022-02-21 04:30:18,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:30:18,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:18,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:30:18,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:30:18,856 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:30:18" (1/1) ... [2022-02-21 04:30:18,862 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:30:18" (1/1) ... [2022-02-21 04:30:18,894 INFO L137 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 430 [2022-02-21 04:30:18,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:30:18,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:30:18,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:30:18,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:30:18,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:30:18,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:30:18,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:30:18,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:30:18,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (1/1) ... [2022-02-21 04:30:18,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,940 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:30:18,962 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:30:18,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:30:18,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:30:18,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:30:18,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:30:19,062 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:30:19,063 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:30:19,454 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:30:19,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:30:19,461 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:30:19,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:19 BoogieIcfgContainer [2022-02-21 04:30:19,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:30:19,464 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:30:19,464 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:30:19,477 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:30:19,477 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:19,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:30:18" (1/3) ... [2022-02-21 04:30:19,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a345aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:19, skipping insertion in model container [2022-02-21 04:30:19,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:19,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:30:18" (2/3) ... [2022-02-21 04:30:19,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a345aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:30:19, skipping insertion in model container [2022-02-21 04:30:19,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:30:19,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:19" (3/3) ... [2022-02-21 04:30:19,480 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2022-02-21 04:30:19,522 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:30:19,523 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:30:19,523 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:30:19,523 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:30:19,523 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:30:19,523 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:30:19,523 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:30:19,523 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:30:19,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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:30:19,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2022-02-21 04:30:19,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:19,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:19,602 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:19,602 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:19,603 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:30:19,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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:30:19,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2022-02-21 04:30:19,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:19,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:19,613 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:19,615 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:19,620 INFO L791 eck$LassoCheckResult]: Stem: 116#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(35, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 39#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~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;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 58#L262true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 24#L262-1true init_#res#1 := init_~tmp~0#1; 40#L463true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 41#L22true assume !(0 == assume_abort_if_not_~cond#1); 101#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 54#L547-2true [2022-02-21 04:30:19,622 INFO L793 eck$LassoCheckResult]: Loop: 54#L547-2true assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 36#L85true 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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 76#L89true assume !(node1_~m1~0#1 != ~nomsg~0); 51#L89-1true ~mode1~0 := 0; 6#L85-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 110#L113true assume !(0 != ~mode2~0 % 256); 75#L126true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 126#L126-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 48#L113-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 66#L138true assume !(0 != ~mode3~0 % 256); 85#L151true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 21#L151-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 94#L138-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 55#L163true assume !(0 != ~mode4~0 % 256); 44#L176true assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite7#1 := ~p4_new~0; 122#L176-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 49#L163-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 17#L188true assume !(0 != ~mode5~0 % 256); 67#L201true assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite8#1 := ~p5_new~0; 111#L201-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 10#L188-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 120#L213true assume !(0 != ~mode6~0 % 256); 12#L226true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 38#L226-2true ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 15#L213-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 25#L238true assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 29#L241true assume !(node7_~m7~0#1 != ~nomsg~0); 127#L241-1true ~mode7~0 := 0; 100#L238-2true assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 23#L471true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 107#L471-1true check_#res#1 := check_~tmp~1#1; 7#L491true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 98#L583true assume !(0 == assert_~arg#1 % 256); 46#L578true assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 54#L547-2true [2022-02-21 04:30:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2022-02-21 04:30:19,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:19,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565298912] [2022-02-21 04:30:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:19,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#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(35, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; {131#true} is VALID [2022-02-21 04:30:19,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~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;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {131#true} is VALID [2022-02-21 04:30:19,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {133#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:30:19,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {134#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:30:19,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {135#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:30:19,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {132#false} is VALID [2022-02-21 04:30:19,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {132#false} is VALID [2022-02-21 04:30:19,823 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:30:19,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:19,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565298912] [2022-02-21 04:30:19,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565298912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:19,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:19,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:19,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529475440] [2022-02-21 04:30:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:19,829 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:30:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1674595954, now seen corresponding path program 1 times [2022-02-21 04:30:19,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:19,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272306587] [2022-02-21 04:30:19,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:19,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:20,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#true} assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume !(node1_~m1~0#1 != ~nomsg~0); {136#true} is VALID [2022-02-21 04:30:20,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {136#true} ~mode1~0 := 0; {136#true} is VALID [2022-02-21 04:30:20,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {136#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} assume !(0 != ~mode2~0 % 256); {136#true} is VALID [2022-02-21 04:30:20,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {136#true} is VALID [2022-02-21 04:30:20,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {136#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {136#true} is VALID [2022-02-21 04:30:20,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#true} assume !(0 != ~mode3~0 % 256); {136#true} is VALID [2022-02-21 04:30:20,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {136#true} is VALID [2022-02-21 04:30:20,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {136#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {136#true} is VALID [2022-02-21 04:30:20,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {136#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {136#true} assume !(0 != ~mode4~0 % 256); {136#true} is VALID [2022-02-21 04:30:20,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {136#true} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite7#1 := ~p4_new~0; {136#true} is VALID [2022-02-21 04:30:20,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {136#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {136#true} is VALID [2022-02-21 04:30:20,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {136#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {136#true} assume !(0 != ~mode5~0 % 256); {136#true} is VALID [2022-02-21 04:30:20,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {136#true} assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite8#1 := ~p5_new~0; {136#true} is VALID [2022-02-21 04:30:20,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {136#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {136#true} is VALID [2022-02-21 04:30:20,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {136#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {136#true} assume !(0 != ~mode6~0 % 256); {136#true} is VALID [2022-02-21 04:30:20,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {136#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {136#true} is VALID [2022-02-21 04:30:20,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {136#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {136#true} is VALID [2022-02-21 04:30:20,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {136#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {136#true} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {136#true} is VALID [2022-02-21 04:30:20,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {136#true} assume !(node7_~m7~0#1 != ~nomsg~0); {136#true} is VALID [2022-02-21 04:30:20,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {136#true} ~mode7~0 := 0; {136#true} is VALID [2022-02-21 04:30:20,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {136#true} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {136#true} is VALID [2022-02-21 04:30:20,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {136#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {138#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:20,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {138#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {139#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:20,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {139#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {140#(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:30:20,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {140#(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); {137#false} is VALID [2022-02-21 04:30:20,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {137#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {137#false} is VALID [2022-02-21 04:30:20,019 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:30:20,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:20,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272306587] [2022-02-21 04:30:20,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272306587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:20,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:20,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:20,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140620456] [2022-02-21 04:30:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:20,025 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:20,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:20,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:20,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:20,055 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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 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:30:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:20,468 INFO L93 Difference]: Finished difference Result 130 states and 219 transitions. [2022-02-21 04:30:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:20,469 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:30:20,477 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:30:20,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 219 transitions. [2022-02-21 04:30:20,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-02-21 04:30:20,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 162 transitions. [2022-02-21 04:30:20,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-02-21 04:30:20,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-02-21 04:30:20,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 162 transitions. [2022-02-21 04:30:20,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:20,514 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-02-21 04:30:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 162 transitions. [2022-02-21 04:30:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-02-21 04:30:20,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:20,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states and 162 transitions. Second operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 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:30:20,544 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states and 162 transitions. Second operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 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:30:20,545 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 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:30:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:20,552 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2022-02-21 04:30:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2022-02-21 04:30:20,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:20,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:20,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 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 122 states and 162 transitions. [2022-02-21 04:30:20,555 INFO L87 Difference]: Start difference. First operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 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 122 states and 162 transitions. [2022-02-21 04:30:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:20,559 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2022-02-21 04:30:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2022-02-21 04:30:20,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:20,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:20,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:20,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 0 states have call successors, (0), 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:30:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2022-02-21 04:30:20,565 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-02-21 04:30:20,566 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-02-21 04:30:20,566 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:30:20,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2022-02-21 04:30:20,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-02-21 04:30:20,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:20,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:20,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:20,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:20,576 INFO L791 eck$LassoCheckResult]: Stem: 395#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(35, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 340#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~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;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 341#L262 assume 0 == ~r1~0; 363#L263 assume ~id1~0 >= 0; 366#L264 assume 0 == ~st1~0; 367#L265 assume ~send1~0 == ~id1~0; 296#L266 assume 0 == ~mode1~0 % 256; 297#L267 assume ~id2~0 >= 0; 307#L268 assume 0 == ~st2~0; 308#L269 assume ~send2~0 == ~id2~0; 290#L270 assume 0 == ~mode2~0 % 256; 291#L271 assume ~id3~0 >= 0; 329#L272 assume 0 == ~st3~0; 345#L273 assume ~send3~0 == ~id3~0; 365#L274 assume 0 == ~mode3~0 % 256; 389#L275 assume ~id4~0 >= 0; 275#L276 assume 0 == ~st4~0; 276#L277 assume ~send4~0 == ~id4~0; 396#L278 assume 0 == ~mode4~0 % 256; 361#L279 assume ~id5~0 >= 0; 362#L280 assume 0 == ~st5~0; 300#L281 assume ~send5~0 == ~id5~0; 277#L282 assume 0 == ~mode5~0 % 256; 278#L283 assume ~id6~0 >= 0; 368#L284 assume 0 == ~st6~0; 369#L285 assume ~send6~0 == ~id6~0; 387#L286 assume 0 == ~mode6~0 % 256; 374#L287 assume ~id7~0 >= 0; 321#L288 assume 0 == ~st7~0; 322#L289 assume ~send7~0 == ~id7~0; 333#L290 assume 0 == ~mode7~0 % 256; 381#L291 assume ~id1~0 != ~id2~0; 382#L292 assume ~id1~0 != ~id3~0; 390#L293 assume ~id1~0 != ~id4~0; 394#L294 assume ~id1~0 != ~id5~0; 283#L295 assume ~id1~0 != ~id6~0; 284#L296 assume ~id1~0 != ~id7~0; 330#L297 assume ~id2~0 != ~id3~0; 327#L298 assume ~id2~0 != ~id4~0; 328#L299 assume ~id2~0 != ~id5~0; 339#L300 assume ~id2~0 != ~id6~0; 375#L301 assume ~id2~0 != ~id7~0; 385#L302 assume ~id3~0 != ~id4~0; 386#L303 assume ~id3~0 != ~id5~0; 392#L304 assume ~id3~0 != ~id6~0; 370#L305 assume ~id3~0 != ~id7~0; 371#L306 assume ~id4~0 != ~id5~0; 380#L307 assume ~id4~0 != ~id6~0; 292#L308 assume ~id4~0 != ~id7~0; 293#L309 assume ~id5~0 != ~id6~0; 379#L310 assume ~id5~0 != ~id7~0; 356#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 319#L262-1 init_#res#1 := init_~tmp~0#1; 320#L463 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 342#L22 assume !(0 == assume_abort_if_not_~cond#1); 344#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 352#L547-2 [2022-02-21 04:30:20,577 INFO L793 eck$LassoCheckResult]: Loop: 352#L547-2 assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 336#L85 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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 337#L89 assume !(node1_~m1~0#1 != ~nomsg~0); 335#L89-1 ~mode1~0 := 0; 281#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 282#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 326#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 286#L116-1 ~mode2~0 := 0; 353#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 354#L138 assume !(0 != ~mode3~0 % 256); 372#L151 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 312#L151-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 313#L138-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 359#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 360#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 305#L166-1 ~mode4~0 := 0; 355#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 301#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 302#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 383#L191-1 ~mode5~0 := 0; 288#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 289#L213 assume !(0 != ~mode6~0 % 256); 294#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 295#L226-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 298#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 299#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 317#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 324#L241-1 ~mode7~0 := 0; 358#L238-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 314#L471 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 315#L471-1 check_#res#1 := check_~tmp~1#1; 279#L491 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 280#L583 assume !(0 == assert_~arg#1 % 256); 351#L578 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 352#L547-2 [2022-02-21 04:30:20,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2022-02-21 04:30:20,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:20,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921877439] [2022-02-21 04:30:20,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:20,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:20,613 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:20,657 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 144901296, now seen corresponding path program 1 times [2022-02-21 04:30:20,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:20,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704795879] [2022-02-21 04:30:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:20,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {646#true} assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {646#true} assume !(node1_~m1~0#1 != ~nomsg~0); {646#true} is VALID [2022-02-21 04:30:20,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {646#true} ~mode1~0 := 0; {646#true} is VALID [2022-02-21 04:30:20,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {646#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {646#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {646#true} assume !(node2_~m2~0#1 != ~nomsg~0); {646#true} is VALID [2022-02-21 04:30:20,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {646#true} ~mode2~0 := 0; {646#true} is VALID [2022-02-21 04:30:20,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {646#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {646#true} assume !(0 != ~mode3~0 % 256); {646#true} is VALID [2022-02-21 04:30:20,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {646#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {646#true} is VALID [2022-02-21 04:30:20,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {646#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {646#true} is VALID [2022-02-21 04:30:20,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {646#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#true} assume !(node4_~m4~0#1 != ~nomsg~0); {646#true} is VALID [2022-02-21 04:30:20,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#true} ~mode4~0 := 0; {646#true} is VALID [2022-02-21 04:30:20,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {646#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {646#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {646#true} assume !(node5_~m5~0#1 != ~nomsg~0); {646#true} is VALID [2022-02-21 04:30:20,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {646#true} ~mode5~0 := 0; {646#true} is VALID [2022-02-21 04:30:20,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {646#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {646#true} assume !(0 != ~mode6~0 % 256); {646#true} is VALID [2022-02-21 04:30:20,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {646#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {646#true} is VALID [2022-02-21 04:30:20,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {646#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {646#true} is VALID [2022-02-21 04:30:20,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {646#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {646#true} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {646#true} is VALID [2022-02-21 04:30:20,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {646#true} assume !(node7_~m7~0#1 != ~nomsg~0); {646#true} is VALID [2022-02-21 04:30:20,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {646#true} ~mode7~0 := 0; {646#true} is VALID [2022-02-21 04:30:20,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {646#true} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {646#true} is VALID [2022-02-21 04:30:20,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {646#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {648#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:20,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {648#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {649#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:20,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {649#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {650#(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:30:20,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {650#(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); {647#false} is VALID [2022-02-21 04:30:20,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {647#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {647#false} is VALID [2022-02-21 04:30:20,736 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:30:20,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:20,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704795879] [2022-02-21 04:30:20,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704795879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:20,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:20,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:20,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571493383] [2022-02-21 04:30:20,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:20,737 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:20,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:20,738 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. cyclomatic complexity: 41 Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:30:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:21,046 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2022-02-21 04:30:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:21,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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:30:21,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:21,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 164 transitions. [2022-02-21 04:30:21,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-02-21 04:30:21,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 159 transitions. [2022-02-21 04:30:21,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-02-21 04:30:21,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-02-21 04:30:21,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 159 transitions. [2022-02-21 04:30:21,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:21,086 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-02-21 04:30:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 159 transitions. [2022-02-21 04:30:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-02-21 04:30:21,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:21,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states and 159 transitions. Second operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 0 states have call successors, (0), 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:30:21,090 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states and 159 transitions. Second operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 0 states have call successors, (0), 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:30:21,090 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. Second operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 0 states have call successors, (0), 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:30:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:21,093 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2022-02-21 04:30:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2022-02-21 04:30:21,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:21,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:21,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 0 states have call successors, (0), 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 122 states and 159 transitions. [2022-02-21 04:30:21,095 INFO L87 Difference]: Start difference. First operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 0 states have call successors, (0), 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 122 states and 159 transitions. [2022-02-21 04:30:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:21,099 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2022-02-21 04:30:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2022-02-21 04:30:21,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:21,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:21,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:21,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 0 states have call successors, (0), 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:30:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2022-02-21 04:30:21,104 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-02-21 04:30:21,104 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-02-21 04:30:21,104 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:30:21,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2022-02-21 04:30:21,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-02-21 04:30:21,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:21,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:21,106 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:21,107 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:21,107 INFO L791 eck$LassoCheckResult]: Stem: 900#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(35, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 844#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~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;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 845#L262 assume 0 == ~r1~0; 868#L263 assume ~id1~0 >= 0; 871#L264 assume 0 == ~st1~0; 872#L265 assume ~send1~0 == ~id1~0; 801#L266 assume 0 == ~mode1~0 % 256; 802#L267 assume ~id2~0 >= 0; 812#L268 assume 0 == ~st2~0; 813#L269 assume ~send2~0 == ~id2~0; 795#L270 assume 0 == ~mode2~0 % 256; 796#L271 assume ~id3~0 >= 0; 833#L272 assume 0 == ~st3~0; 850#L273 assume ~send3~0 == ~id3~0; 870#L274 assume 0 == ~mode3~0 % 256; 894#L275 assume ~id4~0 >= 0; 780#L276 assume 0 == ~st4~0; 781#L277 assume ~send4~0 == ~id4~0; 901#L278 assume 0 == ~mode4~0 % 256; 866#L279 assume ~id5~0 >= 0; 867#L280 assume 0 == ~st5~0; 805#L281 assume ~send5~0 == ~id5~0; 782#L282 assume 0 == ~mode5~0 % 256; 783#L283 assume ~id6~0 >= 0; 873#L284 assume 0 == ~st6~0; 874#L285 assume ~send6~0 == ~id6~0; 892#L286 assume 0 == ~mode6~0 % 256; 879#L287 assume ~id7~0 >= 0; 825#L288 assume 0 == ~st7~0; 826#L289 assume ~send7~0 == ~id7~0; 835#L290 assume 0 == ~mode7~0 % 256; 886#L291 assume ~id1~0 != ~id2~0; 887#L292 assume ~id1~0 != ~id3~0; 895#L293 assume ~id1~0 != ~id4~0; 899#L294 assume ~id1~0 != ~id5~0; 788#L295 assume ~id1~0 != ~id6~0; 789#L296 assume ~id1~0 != ~id7~0; 834#L297 assume ~id2~0 != ~id3~0; 831#L298 assume ~id2~0 != ~id4~0; 832#L299 assume ~id2~0 != ~id5~0; 843#L300 assume ~id2~0 != ~id6~0; 880#L301 assume ~id2~0 != ~id7~0; 890#L302 assume ~id3~0 != ~id4~0; 891#L303 assume ~id3~0 != ~id5~0; 897#L304 assume ~id3~0 != ~id6~0; 875#L305 assume ~id3~0 != ~id7~0; 876#L306 assume ~id4~0 != ~id5~0; 885#L307 assume ~id4~0 != ~id6~0; 797#L308 assume ~id4~0 != ~id7~0; 798#L309 assume ~id5~0 != ~id6~0; 884#L310 assume ~id5~0 != ~id7~0; 861#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 821#L262-1 init_#res#1 := init_~tmp~0#1; 822#L463 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 846#L22 assume !(0 == assume_abort_if_not_~cond#1); 849#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 857#L547-2 [2022-02-21 04:30:21,107 INFO L793 eck$LassoCheckResult]: Loop: 857#L547-2 assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 840#L85 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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 841#L89 assume !(node1_~m1~0#1 != ~nomsg~0); 839#L89-1 ~mode1~0 := 0; 786#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 787#L113 assume !(0 != ~mode2~0 % 256); 881#L126 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 882#L126-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 858#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 859#L138 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 853#L141 assume !(node3_~m3~0#1 != ~nomsg~0); 854#L141-1 ~mode3~0 := 0; 818#L138-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 864#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 865#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 810#L166-1 ~mode4~0 := 0; 860#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 806#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 807#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 888#L191-1 ~mode5~0 := 0; 793#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 794#L213 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 898#L216 assume !(node6_~m6~0#1 != ~nomsg~0); 816#L216-1 ~mode6~0 := 0; 803#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 804#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 823#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 828#L241-1 ~mode7~0 := 0; 863#L238-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 819#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 820#L472 assume ~r1~0 >= 7; 837#L476 assume ~r1~0 < 7;check_~tmp~1#1 := 1; 847#L471-1 check_#res#1 := check_~tmp~1#1; 784#L491 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 785#L583 assume !(0 == assert_~arg#1 % 256); 856#L578 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 857#L547-2 [2022-02-21 04:30:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2022-02-21 04:30:21,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:21,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445204911] [2022-02-21 04:30:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:21,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:21,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:21,162 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1887374250, now seen corresponding path program 1 times [2022-02-21 04:30:21,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:21,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248856182] [2022-02-21 04:30:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:21,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {1151#true} assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1151#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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1151#true} assume !(node1_~m1~0#1 != ~nomsg~0); {1151#true} is VALID [2022-02-21 04:30:21,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {1151#true} ~mode1~0 := 0; {1151#true} is VALID [2022-02-21 04:30:21,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {1151#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1151#true} assume !(0 != ~mode2~0 % 256); {1151#true} is VALID [2022-02-21 04:30:21,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {1151#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1151#true} is VALID [2022-02-21 04:30:21,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1151#true} is VALID [2022-02-21 04:30:21,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {1151#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {1151#true} assume !(node3_~m3~0#1 != ~nomsg~0); {1151#true} is VALID [2022-02-21 04:30:21,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {1151#true} ~mode3~0 := 0; {1151#true} is VALID [2022-02-21 04:30:21,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {1151#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {1151#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {1151#true} assume !(node4_~m4~0#1 != ~nomsg~0); {1151#true} is VALID [2022-02-21 04:30:21,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {1151#true} ~mode4~0 := 0; {1151#true} is VALID [2022-02-21 04:30:21,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {1151#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {1151#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {1151#true} assume !(node5_~m5~0#1 != ~nomsg~0); {1151#true} is VALID [2022-02-21 04:30:21,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {1151#true} ~mode5~0 := 0; {1151#true} is VALID [2022-02-21 04:30:21,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {1151#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {1151#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {1151#true} assume !(node6_~m6~0#1 != ~nomsg~0); {1151#true} is VALID [2022-02-21 04:30:21,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {1151#true} ~mode6~0 := 0; {1151#true} is VALID [2022-02-21 04:30:21,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {1151#true} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {1151#true} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1151#true} is VALID [2022-02-21 04:30:21,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {1151#true} assume !(node7_~m7~0#1 != ~nomsg~0); {1151#true} is VALID [2022-02-21 04:30:21,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {1151#true} ~mode7~0 := 0; {1151#true} is VALID [2022-02-21 04:30:21,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {1151#true} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1151#true} is VALID [2022-02-21 04:30:21,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {1151#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {1151#true} is VALID [2022-02-21 04:30:21,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {1151#true} assume ~r1~0 >= 7; {1153#(not (<= ~r1~0 6))} is VALID [2022-02-21 04:30:21,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {1153#(not (<= ~r1~0 6))} assume ~r1~0 < 7;check_~tmp~1#1 := 1; {1152#false} is VALID [2022-02-21 04:30:21,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {1152#false} check_#res#1 := check_~tmp~1#1; {1152#false} is VALID [2022-02-21 04:30:21,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {1152#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1152#false} is VALID [2022-02-21 04:30:21,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {1152#false} assume !(0 == assert_~arg#1 % 256); {1152#false} is VALID [2022-02-21 04:30:21,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {1152#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1152#false} is VALID [2022-02-21 04:30:21,199 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:30:21,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:21,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248856182] [2022-02-21 04:30:21,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248856182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:21,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:21,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:21,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464148757] [2022-02-21 04:30:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:21,201 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:21,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:21,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:21,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:21,202 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:30:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:21,357 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2022-02-21 04:30:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:21,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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:30:21,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:21,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 251 transitions. [2022-02-21 04:30:21,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2022-02-21 04:30:21,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 251 transitions. [2022-02-21 04:30:21,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2022-02-21 04:30:21,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2022-02-21 04:30:21,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 251 transitions. [2022-02-21 04:30:21,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:21,389 INFO L681 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-02-21 04:30:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 251 transitions. [2022-02-21 04:30:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-02-21 04:30:21,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:21,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states and 251 transitions. Second operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 0 states have call successors, (0), 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:30:21,394 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states and 251 transitions. Second operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 0 states have call successors, (0), 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:30:21,394 INFO L87 Difference]: Start difference. First operand 182 states and 251 transitions. Second operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 0 states have call successors, (0), 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:30:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:21,397 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2022-02-21 04:30:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2022-02-21 04:30:21,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:21,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:21,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 0 states have call successors, (0), 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 182 states and 251 transitions. [2022-02-21 04:30:21,399 INFO L87 Difference]: Start difference. First operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 0 states have call successors, (0), 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 182 states and 251 transitions. [2022-02-21 04:30:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:21,402 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2022-02-21 04:30:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2022-02-21 04:30:21,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:21,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:21,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:21,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 0 states have call successors, (0), 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:30:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2022-02-21 04:30:21,414 INFO L704 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-02-21 04:30:21,414 INFO L587 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-02-21 04:30:21,414 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:30:21,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. [2022-02-21 04:30:21,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2022-02-21 04:30:21,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:21,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:21,416 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:21,416 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:30:21,417 INFO L791 eck$LassoCheckResult]: Stem: 1459#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(35, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 1399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~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;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1400#L262 assume 0 == ~r1~0; 1423#L263 assume ~id1~0 >= 0; 1426#L264 assume 0 == ~st1~0; 1427#L265 assume ~send1~0 == ~id1~0; 1359#L266 assume 0 == ~mode1~0 % 256; 1360#L267 assume ~id2~0 >= 0; 1371#L268 assume 0 == ~st2~0; 1372#L269 assume ~send2~0 == ~id2~0; 1351#L270 assume 0 == ~mode2~0 % 256; 1352#L271 assume ~id3~0 >= 0; 1389#L272 assume 0 == ~st3~0; 1404#L273 assume ~send3~0 == ~id3~0; 1425#L274 assume 0 == ~mode3~0 % 256; 1451#L275 assume ~id4~0 >= 0; 1336#L276 assume 0 == ~st4~0; 1337#L277 assume ~send4~0 == ~id4~0; 1460#L278 assume 0 == ~mode4~0 % 256; 1421#L279 assume ~id5~0 >= 0; 1422#L280 assume 0 == ~st5~0; 1361#L281 assume ~send5~0 == ~id5~0; 1338#L282 assume 0 == ~mode5~0 % 256; 1339#L283 assume ~id6~0 >= 0; 1428#L284 assume 0 == ~st6~0; 1429#L285 assume ~send6~0 == ~id6~0; 1449#L286 assume 0 == ~mode6~0 % 256; 1434#L287 assume ~id7~0 >= 0; 1381#L288 assume 0 == ~st7~0; 1382#L289 assume ~send7~0 == ~id7~0; 1392#L290 assume 0 == ~mode7~0 % 256; 1443#L291 assume ~id1~0 != ~id2~0; 1444#L292 assume ~id1~0 != ~id3~0; 1452#L293 assume ~id1~0 != ~id4~0; 1458#L294 assume ~id1~0 != ~id5~0; 1344#L295 assume ~id1~0 != ~id6~0; 1345#L296 assume ~id1~0 != ~id7~0; 1390#L297 assume ~id2~0 != ~id3~0; 1387#L298 assume ~id2~0 != ~id4~0; 1388#L299 assume ~id2~0 != ~id5~0; 1398#L300 assume ~id2~0 != ~id6~0; 1435#L301 assume ~id2~0 != ~id7~0; 1447#L302 assume ~id3~0 != ~id4~0; 1448#L303 assume ~id3~0 != ~id5~0; 1456#L304 assume ~id3~0 != ~id6~0; 1430#L305 assume ~id3~0 != ~id7~0; 1431#L306 assume ~id4~0 != ~id5~0; 1442#L307 assume ~id4~0 != ~id6~0; 1355#L308 assume ~id4~0 != ~id7~0; 1356#L309 assume ~id5~0 != ~id6~0; 1441#L310 assume ~id5~0 != ~id7~0; 1416#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 1379#L262-1 init_#res#1 := init_~tmp~0#1; 1380#L463 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1401#L22 assume !(0 == assume_abort_if_not_~cond#1); 1402#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1411#L547-2 [2022-02-21 04:30:21,417 INFO L793 eck$LassoCheckResult]: Loop: 1411#L547-2 assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1395#L85 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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 1396#L89 assume !(node1_~m1~0#1 != ~nomsg~0); 1394#L89-1 ~mode1~0 := 0; 1340#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1341#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1385#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 1347#L116-1 ~mode2~0 := 0; 1412#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1413#L138 assume !(0 != ~mode3~0 % 256); 1432#L151 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 1373#L151-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 1374#L138-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1419#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1420#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 1366#L166-1 ~mode4~0 := 0; 1414#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1362#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1363#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 1445#L191-1 ~mode5~0 := 0; 1349#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1350#L213 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1457#L216 assume !(node6_~m6~0#1 != ~nomsg~0); 1370#L216-1 ~mode6~0 := 0; 1357#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 1358#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1377#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 1384#L241-1 ~mode7~0 := 0; 1418#L238-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1462#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 1461#L472 assume !(~r1~0 >= 7); 1439#L475 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 1440#L476 assume ~r1~0 < 7;check_~tmp~1#1 := 1; 1517#L471-1 check_#res#1 := check_~tmp~1#1; 1516#L491 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 1454#L583 assume !(0 == assert_~arg#1 % 256); 1410#L578 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 1411#L547-2 [2022-02-21 04:30:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2022-02-21 04:30:21,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:21,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459038741] [2022-02-21 04:30:21,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:21,452 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:21,484 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash 931303707, now seen corresponding path program 1 times [2022-02-21 04:30:21,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:21,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915277839] [2022-02-21 04:30:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:21,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:21,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:21,514 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:21,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash -721431126, now seen corresponding path program 1 times [2022-02-21 04:30:21,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:21,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639636959] [2022-02-21 04:30:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:21,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {1889#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(35, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; {1889#true} is VALID [2022-02-21 04:30:21,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {1889#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~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;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1889#true} is VALID [2022-02-21 04:30:21,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1889#true} assume 0 == ~r1~0; {1889#true} is VALID [2022-02-21 04:30:21,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {1889#true} assume ~id1~0 >= 0; {1889#true} is VALID [2022-02-21 04:30:21,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {1889#true} assume 0 == ~st1~0; {1889#true} is VALID [2022-02-21 04:30:21,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {1889#true} assume ~send1~0 == ~id1~0; {1889#true} is VALID [2022-02-21 04:30:21,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {1889#true} assume 0 == ~mode1~0 % 256; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1891#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:30:21,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {1891#(= (+ (* (- 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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {1890#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-21 04:30:21,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {1890#false} ~mode1~0 := 0; {1890#false} is VALID [2022-02-21 04:30:21,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {1890#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {1890#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {1890#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-21 04:30:21,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {1890#false} ~mode2~0 := 0; {1890#false} is VALID [2022-02-21 04:30:21,597 INFO L290 TraceCheckUtils]: 64: Hoare triple {1890#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {1890#false} assume !(0 != ~mode3~0 % 256); {1890#false} is VALID [2022-02-21 04:30:21,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {1890#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {1890#false} is VALID [2022-02-21 04:30:21,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {1890#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {1890#false} is VALID [2022-02-21 04:30:21,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {1890#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {1890#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {1890#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-21 04:30:21,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {1890#false} ~mode4~0 := 0; {1890#false} is VALID [2022-02-21 04:30:21,599 INFO L290 TraceCheckUtils]: 72: Hoare triple {1890#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,599 INFO L290 TraceCheckUtils]: 73: Hoare triple {1890#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,599 INFO L290 TraceCheckUtils]: 74: Hoare triple {1890#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-21 04:30:21,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {1890#false} ~mode5~0 := 0; {1890#false} is VALID [2022-02-21 04:30:21,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {1890#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {1890#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {1890#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-21 04:30:21,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {1890#false} ~mode6~0 := 0; {1890#false} is VALID [2022-02-21 04:30:21,600 INFO L290 TraceCheckUtils]: 80: Hoare triple {1890#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,600 INFO L290 TraceCheckUtils]: 81: Hoare triple {1890#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1890#false} is VALID [2022-02-21 04:30:21,600 INFO L290 TraceCheckUtils]: 82: Hoare triple {1890#false} assume !(node7_~m7~0#1 != ~nomsg~0); {1890#false} is VALID [2022-02-21 04:30:21,600 INFO L290 TraceCheckUtils]: 83: Hoare triple {1890#false} ~mode7~0 := 0; {1890#false} is VALID [2022-02-21 04:30:21,601 INFO L290 TraceCheckUtils]: 84: Hoare triple {1890#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1890#false} is VALID [2022-02-21 04:30:21,601 INFO L290 TraceCheckUtils]: 85: Hoare triple {1890#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {1890#false} is VALID [2022-02-21 04:30:21,601 INFO L290 TraceCheckUtils]: 86: Hoare triple {1890#false} assume !(~r1~0 >= 7); {1890#false} is VALID [2022-02-21 04:30:21,601 INFO L290 TraceCheckUtils]: 87: Hoare triple {1890#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; {1890#false} is VALID [2022-02-21 04:30:21,601 INFO L290 TraceCheckUtils]: 88: Hoare triple {1890#false} assume ~r1~0 < 7;check_~tmp~1#1 := 1; {1890#false} is VALID [2022-02-21 04:30:21,601 INFO L290 TraceCheckUtils]: 89: Hoare triple {1890#false} check_#res#1 := check_~tmp~1#1; {1890#false} is VALID [2022-02-21 04:30:21,601 INFO L290 TraceCheckUtils]: 90: Hoare triple {1890#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1890#false} is VALID [2022-02-21 04:30:21,602 INFO L290 TraceCheckUtils]: 91: Hoare triple {1890#false} assume !(0 == assert_~arg#1 % 256); {1890#false} is VALID [2022-02-21 04:30:21,602 INFO L290 TraceCheckUtils]: 92: Hoare triple {1890#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1890#false} is VALID [2022-02-21 04:30:21,603 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:30:21,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:21,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639636959] [2022-02-21 04:30:21,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639636959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:21,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:21,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:21,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179323956] [2022-02-21 04:30:21,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:22,776 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:22,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:22,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:22,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:22,777 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:30:22,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:22,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:22,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:22,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.1.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2022-02-21 04:30:22,777 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:22,777 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:22,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:22,799 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:30:22,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:22,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:22,811 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:30:22,814 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:30:22,817 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:30:22,821 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:30:22,823 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:30:22,826 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:30:22,829 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:30:22,831 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:30:22,954 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:30:22,957 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:30:22,959 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:30:22,963 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:30:22,966 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:30:22,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:22,972 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:30:22,975 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:30:22,978 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:30:22,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,572 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:30:25,573 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:30:25,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:25,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:25,576 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:30:25,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:30:25,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:30:25,591 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:30:25,616 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:30:25,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:25,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:25,617 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:30:25,618 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:30:25,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:30:25,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:30:25,736 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:30:25,739 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:30:25,741 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:25,741 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:25,741 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:25,741 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:25,741 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:30:25,741 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:25,741 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:25,741 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:25,741 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.1.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2022-02-21 04:30:25,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:25,741 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:25,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,754 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:30:25,770 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:30:25,780 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:30:25,782 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:30:25,785 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:30:25,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,793 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:30:25,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,930 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:30:25,933 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:30:25,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,938 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:30:25,942 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:30:25,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:25,949 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:30:25,955 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:30:25,959 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:30:28,402 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:30:28,405 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:30:28,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,407 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:30:28,408 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:30:28,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:28,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,435 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:30:28,436 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:30:28,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:28,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,479 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:30:28,480 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:30:28,481 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:30:28,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,518 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:30:28,519 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:30:28,520 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:30:28,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,525 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:30:28,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,527 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:30:28,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,545 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:30:28,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,546 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:30:28,547 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:30:28,548 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:30:28,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:30:28,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,575 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:30:28,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:28,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 04:30:28,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,611 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:30:28,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:28,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,638 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:30:28,640 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:30:28,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,665 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:30:28,666 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:30:28,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:30:28,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,690 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:30:28,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:28,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,719 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:30:28,721 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:30:28,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,727 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-02-21 04:30:28,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,760 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 04:30:28,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,808 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:30:28,810 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:30:28,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,848 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:30:28,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:28,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,875 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:30:28,877 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:30:28,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:28,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:28,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,910 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:30:28,913 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:30:28,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:28,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:28,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:28,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:28,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:28,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:28,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:28,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:30:28,973 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:30:28,974 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:30:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:28,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:28,976 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:28,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:30:28,978 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:30:28,978 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:30:28,978 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:30:28,978 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 27 Supporting invariants [] [2022-02-21 04:30:28,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:29,007 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:30:29,012 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_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~ite5#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~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume !(0 != ~mode3~0 % 256);" "assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0;" "~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0#1 != ~nomsg~0);" "~mode4~0 := 0;" "assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0#1 != ~nomsg~0);" "~mode5~0 := 0;" "assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0;" "assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node6_~m6~0#1 != ~nomsg~0);" "~mode6~0 := 0;" "assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0;" "assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0;" "assume !(node7_~m7~0#1 != ~nomsg~0);" "~mode7~0 := 0;" "assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1;" "assume !(~r1~0 >= 7);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0;" "assume ~r1~0 < 7;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1;" [2022-02-21 04:30:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:29,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:30:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:29,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:30:29,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {1892#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(35, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {1892#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~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;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1892#unseeded} is VALID [2022-02-21 04:30:29,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {1892#unseeded} assume 0 == ~r1~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {1892#unseeded} assume ~id1~0 >= 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {1892#unseeded} assume 0 == ~st1~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {1892#unseeded} assume ~send1~0 == ~id1~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {1892#unseeded} assume 0 == ~mode1~0 % 256; {1892#unseeded} is VALID [2022-02-21 04:30:29,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {1892#unseeded} assume ~id2~0 >= 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {1892#unseeded} assume 0 == ~st2~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {1892#unseeded} assume ~send2~0 == ~id2~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#unseeded} assume 0 == ~mode2~0 % 256; {1892#unseeded} is VALID [2022-02-21 04:30:29,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#unseeded} assume ~id3~0 >= 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {1892#unseeded} assume 0 == ~st3~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {1892#unseeded} assume ~send3~0 == ~id3~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {1892#unseeded} assume 0 == ~mode3~0 % 256; {1892#unseeded} is VALID [2022-02-21 04:30:29,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {1892#unseeded} assume ~id4~0 >= 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {1892#unseeded} assume 0 == ~st4~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {1892#unseeded} assume ~send4~0 == ~id4~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#unseeded} assume 0 == ~mode4~0 % 256; {1892#unseeded} is VALID [2022-02-21 04:30:29,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {1892#unseeded} assume ~id5~0 >= 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {1892#unseeded} assume 0 == ~st5~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {1892#unseeded} assume ~send5~0 == ~id5~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {1892#unseeded} assume 0 == ~mode5~0 % 256; {1892#unseeded} is VALID [2022-02-21 04:30:29,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {1892#unseeded} assume ~id6~0 >= 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {1892#unseeded} assume 0 == ~st6~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {1892#unseeded} assume ~send6~0 == ~id6~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {1892#unseeded} assume 0 == ~mode6~0 % 256; {1892#unseeded} is VALID [2022-02-21 04:30:29,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {1892#unseeded} assume ~id7~0 >= 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {1892#unseeded} assume 0 == ~st7~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {1892#unseeded} assume ~send7~0 == ~id7~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {1892#unseeded} assume 0 == ~mode7~0 % 256; {1892#unseeded} is VALID [2022-02-21 04:30:29,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {1892#unseeded} assume ~id1~0 != ~id2~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {1892#unseeded} assume ~id1~0 != ~id3~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {1892#unseeded} assume ~id1~0 != ~id4~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {1892#unseeded} assume ~id1~0 != ~id5~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {1892#unseeded} assume ~id1~0 != ~id6~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {1892#unseeded} assume ~id1~0 != ~id7~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {1892#unseeded} assume ~id2~0 != ~id3~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {1892#unseeded} assume ~id2~0 != ~id4~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {1892#unseeded} assume ~id2~0 != ~id5~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {1892#unseeded} assume ~id2~0 != ~id6~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {1892#unseeded} assume ~id2~0 != ~id7~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {1892#unseeded} assume ~id3~0 != ~id4~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {1892#unseeded} assume ~id3~0 != ~id5~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {1892#unseeded} assume ~id3~0 != ~id6~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {1892#unseeded} assume ~id3~0 != ~id7~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {1892#unseeded} assume ~id4~0 != ~id5~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {1892#unseeded} assume ~id4~0 != ~id6~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {1892#unseeded} assume ~id4~0 != ~id7~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {1892#unseeded} assume ~id5~0 != ~id6~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {1892#unseeded} assume ~id5~0 != ~id7~0; {1892#unseeded} is VALID [2022-02-21 04:30:29,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {1892#unseeded} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {1892#unseeded} is VALID [2022-02-21 04:30:29,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {1892#unseeded} init_#res#1 := init_~tmp~0#1; {1892#unseeded} is VALID [2022-02-21 04:30:29,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {1892#unseeded} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1892#unseeded} is VALID [2022-02-21 04:30:29,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {1892#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1892#unseeded} is VALID [2022-02-21 04:30:29,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {1892#unseeded} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1892#unseeded} is VALID [2022-02-21 04:30:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:29,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:30:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:29,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:30:29,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:29,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {1895#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27))} assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} 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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(node1_~m1~0#1 != ~nomsg~0); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} ~mode1~0 := 0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(node2_~m2~0#1 != ~nomsg~0); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} ~mode2~0 := 0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(0 != ~mode3~0 % 256); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(node4_~m4~0#1 != ~nomsg~0); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} ~mode4~0 := 0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(node5_~m5~0#1 != ~nomsg~0); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} ~mode5~0 := 0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(node6_~m6~0#1 != ~nomsg~0); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} ~mode6~0 := 0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(node7_~m7~0#1 != ~nomsg~0); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} ~mode7~0 := 0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(~r1~0 >= 7); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume ~r1~0 < 7;check_~tmp~1#1 := 1; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} check_#res#1 := check_~tmp~1#1; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume !(0 == assert_~arg#1 % 256); {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} is VALID [2022-02-21 04:30:29,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {2075#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27)) (< |ULTIMATE.start_main_~i2~0#1| 14))} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1905#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 27))))} is VALID [2022-02-21 04:30:29,542 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:30:29,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:30:29,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:29,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 37 letters. [2022-02-21 04:30:29,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,568 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:30:29,569 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:30:29,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 307 states and 446 transitions. Complement of second has 4 states. [2022-02-21 04:30:29,726 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:30:29,727 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:30:29,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. cyclomatic complexity: 70 [2022-02-21 04:30:29,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:29,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:29,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:30:29,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:30:29,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:29,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:29,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 446 transitions. [2022-02-21 04:30:29,732 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:30:29,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:30:29,734 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 182 states and 251 transitions. cyclomatic complexity: 70 [2022-02-21 04:30:29,787 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 126 examples of accepted words. [2022-02-21 04:30:29,788 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:30:29,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:30:29,789 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:30:29,790 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 307 states and 446 transitions. cyclomatic complexity: 140 [2022-02-21 04:30:29,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 446 transitions. cyclomatic complexity: 140 [2022-02-21 04:30:29,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:30:29,790 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:30:29,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 56 letters. Loop has 37 letters. [2022-02-21 04:30:29,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 37 letters. [2022-02-21 04:30:29,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 56 letters. Loop has 37 letters. [2022-02-21 04:30:29,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:29,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:30:29,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:29,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 307 letters. Loop has 307 letters. [2022-02-21 04:30:29,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 307 letters. Loop has 307 letters. [2022-02-21 04:30:29,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 307 letters. Loop has 307 letters. [2022-02-21 04:30:29,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 182 letters. Loop has 182 letters. [2022-02-21 04:30:29,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 182 letters. Loop has 182 letters. [2022-02-21 04:30:29,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 182 letters. Loop has 182 letters. [2022-02-21 04:30:29,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:30:29,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:30:29,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:30:29,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:30:29,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:30:29,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:30:29,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:30:29,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:30:29,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:30:29,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 90 letters. Loop has 37 letters. [2022-02-21 04:30:29,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 37 letters. [2022-02-21 04:30:29,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 90 letters. Loop has 37 letters. [2022-02-21 04:30:29,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 91 letters. Loop has 37 letters. [2022-02-21 04:30:29,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 37 letters. [2022-02-21 04:30:29,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 91 letters. Loop has 37 letters. [2022-02-21 04:30:29,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:30:29,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:30:29,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:30:29,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:30:29,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:30:29,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:30:29,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:30:29,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:30:29,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:30:29,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:30:29,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:30:29,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:30:29,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:30:29,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:30:29,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:30:29,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:30:29,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:30:29,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:30:29,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 79 letters. Loop has 37 letters. [2022-02-21 04:30:29,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 37 letters. [2022-02-21 04:30:29,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 79 letters. Loop has 37 letters. [2022-02-21 04:30:29,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 80 letters. Loop has 37 letters. [2022-02-21 04:30:29,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 37 letters. [2022-02-21 04:30:29,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 80 letters. Loop has 37 letters. [2022-02-21 04:30:29,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 81 letters. Loop has 37 letters. [2022-02-21 04:30:29,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 37 letters. [2022-02-21 04:30:29,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 81 letters. Loop has 37 letters. [2022-02-21 04:30:29,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:30:29,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:30:29,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:30:29,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:30:29,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:30:29,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:30:29,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:30:29,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:30:29,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:30:29,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:30:29,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:30:29,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:30:29,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:30:29,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:30:29,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:30:29,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:30:29,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:30:29,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:30:29,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:30:29,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:30:29,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:30:29,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:30:29,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:30:29,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:30:29,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 79 letters. Loop has 37 letters. [2022-02-21 04:30:29,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 37 letters. [2022-02-21 04:30:29,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 79 letters. Loop has 37 letters. [2022-02-21 04:30:29,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:30:29,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:30:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:30:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:30:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:30:29,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:30:29,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 122 letters. Loop has 37 letters. [2022-02-21 04:30:29,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 122 letters. Loop has 37 letters. [2022-02-21 04:30:29,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 122 letters. Loop has 37 letters. [2022-02-21 04:30:29,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 123 letters. Loop has 37 letters. [2022-02-21 04:30:29,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:30:29,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 123 letters. Loop has 37 letters. [2022-02-21 04:30:29,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 82 letters. Loop has 37 letters. [2022-02-21 04:30:29,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 37 letters. [2022-02-21 04:30:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 82 letters. Loop has 37 letters. [2022-02-21 04:30:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 82 letters. Loop has 37 letters. [2022-02-21 04:30:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 37 letters. [2022-02-21 04:30:29,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 82 letters. Loop has 37 letters. [2022-02-21 04:30:29,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 84 letters. Loop has 39 letters. [2022-02-21 04:30:29,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 39 letters. [2022-02-21 04:30:29,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 84 letters. Loop has 39 letters. [2022-02-21 04:30:29,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 83 letters. Loop has 37 letters. [2022-02-21 04:30:29,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 37 letters. [2022-02-21 04:30:29,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 83 letters. Loop has 37 letters. [2022-02-21 04:30:29,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:30:29,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:30:29,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:30:29,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 83 letters. Loop has 38 letters. [2022-02-21 04:30:29,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 38 letters. [2022-02-21 04:30:29,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 83 letters. Loop has 38 letters. [2022-02-21 04:30:29,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 87 letters. Loop has 37 letters. [2022-02-21 04:30:29,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 37 letters. [2022-02-21 04:30:29,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 87 letters. Loop has 37 letters. [2022-02-21 04:30:29,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:30:29,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:30:29,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:30:29,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:30:29,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:30:29,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:30:29,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 57 letters. Loop has 37 letters. [2022-02-21 04:30:29,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 37 letters. [2022-02-21 04:30:29,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 57 letters. Loop has 37 letters. [2022-02-21 04:30:29,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:30:29,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:30:29,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:30:29,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:30:29,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:30:29,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:30:29,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 88 letters. Loop has 37 letters. [2022-02-21 04:30:29,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 37 letters. [2022-02-21 04:30:29,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 88 letters. Loop has 37 letters. [2022-02-21 04:30:29,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:30:29,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:30:29,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:30:29,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:30:29,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:30:29,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:30:29,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:30:29,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:30:29,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:30:29,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:30:29,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:30:29,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:30:29,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:30:29,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:30:29,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:30:29,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 92 letters. Loop has 37 letters. [2022-02-21 04:30:29,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 37 letters. [2022-02-21 04:30:29,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 92 letters. Loop has 37 letters. [2022-02-21 04:30:29,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 56 letters. Loop has 37 letters. [2022-02-21 04:30:29,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 37 letters. [2022-02-21 04:30:29,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 56 letters. Loop has 37 letters. [2022-02-21 04:30:29,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:30:29,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:30:29,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:30:29,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:30:29,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:30:29,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:30:29,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:30:29,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:30:29,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:30:29,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 89 letters. Loop has 37 letters. [2022-02-21 04:30:29,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 37 letters. [2022-02-21 04:30:29,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 89 letters. Loop has 37 letters. [2022-02-21 04:30:29,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 83 letters. Loop has 37 letters. [2022-02-21 04:30:29,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 37 letters. [2022-02-21 04:30:29,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 83 letters. Loop has 37 letters. [2022-02-21 04:30:29,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 84 letters. Loop has 37 letters. [2022-02-21 04:30:29,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 37 letters. [2022-02-21 04:30:29,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 84 letters. Loop has 37 letters. [2022-02-21 04:30:29,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:30:29,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:30:29,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:30:29,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:30:29,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:30:29,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:30:29,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:30:29,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:30:29,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:30:29,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:30:29,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:30:29,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:30:29,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:30:29,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:30:29,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:30:29,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:30:29,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:30:29,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:30:29,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:30:29,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:30:29,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:30:29,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 59 letters. Loop has 38 letters. [2022-02-21 04:30:29,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 38 letters. [2022-02-21 04:30:29,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 59 letters. Loop has 38 letters. [2022-02-21 04:30:29,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 87 letters. Loop has 37 letters. [2022-02-21 04:30:29,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 37 letters. [2022-02-21 04:30:29,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 87 letters. Loop has 37 letters. [2022-02-21 04:30:29,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 88 letters. Loop has 37 letters. [2022-02-21 04:30:29,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 37 letters. [2022-02-21 04:30:29,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 88 letters. Loop has 37 letters. [2022-02-21 04:30:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:30:29,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:30:29,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:30:29,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:30:29,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:30:29,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:30:29,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:30:29,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:30:29,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:30:29,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:30:29,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:30:29,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:30:29,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 91 letters. Loop has 37 letters. [2022-02-21 04:30:29,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 37 letters. [2022-02-21 04:30:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 91 letters. Loop has 37 letters. [2022-02-21 04:30:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 121 letters. Loop has 37 letters. [2022-02-21 04:30:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 121 letters. Loop has 37 letters. [2022-02-21 04:30:29,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 121 letters. Loop has 37 letters. [2022-02-21 04:30:29,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:30:29,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:30:29,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:30:29,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 86 letters. Loop has 37 letters. [2022-02-21 04:30:29,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 37 letters. [2022-02-21 04:30:29,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 86 letters. Loop has 37 letters. [2022-02-21 04:30:29,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 85 letters. Loop has 37 letters. [2022-02-21 04:30:29,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 37 letters. [2022-02-21 04:30:29,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 85 letters. Loop has 37 letters. [2022-02-21 04:30:29,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 120 letters. Loop has 37 letters. [2022-02-21 04:30:29,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 120 letters. Loop has 37 letters. [2022-02-21 04:30:29,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 120 letters. Loop has 37 letters. [2022-02-21 04:30:29,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 120 letters. Loop has 37 letters. [2022-02-21 04:30:29,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 120 letters. Loop has 37 letters. [2022-02-21 04:30:29,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 120 letters. Loop has 37 letters. [2022-02-21 04:30:29,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 120 letters. Loop has 38 letters. [2022-02-21 04:30:29,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 120 letters. Loop has 38 letters. [2022-02-21 04:30:29,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 120 letters. Loop has 38 letters. [2022-02-21 04:30:29,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 121 letters. Loop has 39 letters. [2022-02-21 04:30:29,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 121 letters. Loop has 39 letters. [2022-02-21 04:30:29,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 121 letters. Loop has 39 letters. [2022-02-21 04:30:29,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 119 letters. Loop has 37 letters. [2022-02-21 04:30:29,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 119 letters. Loop has 37 letters. [2022-02-21 04:30:29,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 119 letters. Loop has 37 letters. [2022-02-21 04:30:29,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 118 letters. Loop has 37 letters. [2022-02-21 04:30:29,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 118 letters. Loop has 37 letters. [2022-02-21 04:30:29,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 118 letters. Loop has 37 letters. [2022-02-21 04:30:29,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 119 letters. Loop has 37 letters. [2022-02-21 04:30:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 119 letters. Loop has 37 letters. [2022-02-21 04:30:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 119 letters. Loop has 37 letters. [2022-02-21 04:30:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 117 letters. Loop has 37 letters. [2022-02-21 04:30:29,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 117 letters. Loop has 37 letters. [2022-02-21 04:30:29,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 117 letters. Loop has 37 letters. [2022-02-21 04:30:29,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 116 letters. Loop has 37 letters. [2022-02-21 04:30:29,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 116 letters. Loop has 37 letters. [2022-02-21 04:30:29,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 116 letters. Loop has 37 letters. [2022-02-21 04:30:29,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 116 letters. Loop has 37 letters. [2022-02-21 04:30:29,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 116 letters. Loop has 37 letters. [2022-02-21 04:30:29,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 116 letters. Loop has 37 letters. [2022-02-21 04:30:29,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 117 letters. Loop has 39 letters. [2022-02-21 04:30:29,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 117 letters. Loop has 39 letters. [2022-02-21 04:30:29,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 117 letters. Loop has 39 letters. [2022-02-21 04:30:29,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 115 letters. Loop has 37 letters. [2022-02-21 04:30:29,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 115 letters. Loop has 37 letters. [2022-02-21 04:30:29,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 115 letters. Loop has 37 letters. [2022-02-21 04:30:29,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 116 letters. Loop has 38 letters. [2022-02-21 04:30:29,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 116 letters. Loop has 38 letters. [2022-02-21 04:30:29,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 116 letters. Loop has 38 letters. [2022-02-21 04:30:29,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 115 letters. Loop has 37 letters. [2022-02-21 04:30:29,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 115 letters. Loop has 37 letters. [2022-02-21 04:30:29,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 115 letters. Loop has 37 letters. [2022-02-21 04:30:29,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 114 letters. Loop has 37 letters. [2022-02-21 04:30:29,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 114 letters. Loop has 37 letters. [2022-02-21 04:30:29,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 114 letters. Loop has 37 letters. [2022-02-21 04:30:29,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 113 letters. Loop has 37 letters. [2022-02-21 04:30:29,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 113 letters. Loop has 37 letters. [2022-02-21 04:30:29,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 113 letters. Loop has 37 letters. [2022-02-21 04:30:29,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 112 letters. Loop has 37 letters. [2022-02-21 04:30:29,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 112 letters. Loop has 37 letters. [2022-02-21 04:30:29,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 112 letters. Loop has 37 letters. [2022-02-21 04:30:29,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 112 letters. Loop has 37 letters. [2022-02-21 04:30:29,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 112 letters. Loop has 37 letters. [2022-02-21 04:30:29,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 112 letters. Loop has 37 letters. [2022-02-21 04:30:29,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 113 letters. Loop has 39 letters. [2022-02-21 04:30:29,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 113 letters. Loop has 39 letters. [2022-02-21 04:30:29,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 113 letters. Loop has 39 letters. [2022-02-21 04:30:29,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 111 letters. Loop has 37 letters. [2022-02-21 04:30:29,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 111 letters. Loop has 37 letters. [2022-02-21 04:30:29,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 111 letters. Loop has 37 letters. [2022-02-21 04:30:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 112 letters. Loop has 38 letters. [2022-02-21 04:30:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 112 letters. Loop has 38 letters. [2022-02-21 04:30:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 112 letters. Loop has 38 letters. [2022-02-21 04:30:29,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 110 letters. Loop has 37 letters. [2022-02-21 04:30:29,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 110 letters. Loop has 37 letters. [2022-02-21 04:30:29,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 110 letters. Loop has 37 letters. [2022-02-21 04:30:29,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 111 letters. Loop has 37 letters. [2022-02-21 04:30:29,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 111 letters. Loop has 37 letters. [2022-02-21 04:30:29,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 111 letters. Loop has 37 letters. [2022-02-21 04:30:29,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 109 letters. Loop has 37 letters. [2022-02-21 04:30:29,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 109 letters. Loop has 37 letters. [2022-02-21 04:30:29,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 109 letters. Loop has 37 letters. [2022-02-21 04:30:29,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 108 letters. Loop has 37 letters. [2022-02-21 04:30:29,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 108 letters. Loop has 37 letters. [2022-02-21 04:30:29,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 108 letters. Loop has 37 letters. [2022-02-21 04:30:29,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 108 letters. Loop has 37 letters. [2022-02-21 04:30:29,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 108 letters. Loop has 37 letters. [2022-02-21 04:30:29,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 108 letters. Loop has 37 letters. [2022-02-21 04:30:29,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 109 letters. Loop has 39 letters. [2022-02-21 04:30:29,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 109 letters. Loop has 39 letters. [2022-02-21 04:30:29,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 109 letters. Loop has 39 letters. [2022-02-21 04:30:29,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 107 letters. Loop has 37 letters. [2022-02-21 04:30:29,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 107 letters. Loop has 37 letters. [2022-02-21 04:30:29,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 107 letters. Loop has 37 letters. [2022-02-21 04:30:29,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 108 letters. Loop has 38 letters. [2022-02-21 04:30:29,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 108 letters. Loop has 38 letters. [2022-02-21 04:30:29,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 108 letters. Loop has 38 letters. [2022-02-21 04:30:29,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 106 letters. Loop has 37 letters. [2022-02-21 04:30:29,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 106 letters. Loop has 37 letters. [2022-02-21 04:30:29,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 106 letters. Loop has 37 letters. [2022-02-21 04:30:29,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 107 letters. Loop has 37 letters. [2022-02-21 04:30:29,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 107 letters. Loop has 37 letters. [2022-02-21 04:30:29,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 107 letters. Loop has 37 letters. [2022-02-21 04:30:29,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 105 letters. Loop has 37 letters. [2022-02-21 04:30:29,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 105 letters. Loop has 37 letters. [2022-02-21 04:30:29,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 105 letters. Loop has 37 letters. [2022-02-21 04:30:29,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 104 letters. Loop has 37 letters. [2022-02-21 04:30:29,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 37 letters. [2022-02-21 04:30:29,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 104 letters. Loop has 37 letters. [2022-02-21 04:30:29,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 104 letters. Loop has 37 letters. [2022-02-21 04:30:29,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 37 letters. [2022-02-21 04:30:29,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 104 letters. Loop has 37 letters. [2022-02-21 04:30:29,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 105 letters. Loop has 39 letters. [2022-02-21 04:30:29,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 105 letters. Loop has 39 letters. [2022-02-21 04:30:29,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 105 letters. Loop has 39 letters. [2022-02-21 04:30:29,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 103 letters. Loop has 37 letters. [2022-02-21 04:30:29,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 103 letters. Loop has 37 letters. [2022-02-21 04:30:29,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 103 letters. Loop has 37 letters. [2022-02-21 04:30:29,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 104 letters. Loop has 38 letters. [2022-02-21 04:30:29,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 38 letters. [2022-02-21 04:30:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 104 letters. Loop has 38 letters. [2022-02-21 04:30:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 103 letters. Loop has 37 letters. [2022-02-21 04:30:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 103 letters. Loop has 37 letters. [2022-02-21 04:30:29,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 103 letters. Loop has 37 letters. [2022-02-21 04:30:29,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 102 letters. Loop has 37 letters. [2022-02-21 04:30:29,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 37 letters. [2022-02-21 04:30:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 102 letters. Loop has 37 letters. [2022-02-21 04:30:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 101 letters. Loop has 37 letters. [2022-02-21 04:30:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 37 letters. [2022-02-21 04:30:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 101 letters. Loop has 37 letters. [2022-02-21 04:30:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 100 letters. Loop has 37 letters. [2022-02-21 04:30:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 100 letters. Loop has 37 letters. [2022-02-21 04:30:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 100 letters. Loop has 37 letters. [2022-02-21 04:30:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 100 letters. Loop has 37 letters. [2022-02-21 04:30:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 100 letters. Loop has 37 letters. [2022-02-21 04:30:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 100 letters. Loop has 37 letters. [2022-02-21 04:30:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 101 letters. Loop has 39 letters. [2022-02-21 04:30:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 39 letters. [2022-02-21 04:30:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 101 letters. Loop has 39 letters. [2022-02-21 04:30:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 99 letters. Loop has 37 letters. [2022-02-21 04:30:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 99 letters. Loop has 37 letters. [2022-02-21 04:30:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 99 letters. Loop has 37 letters. [2022-02-21 04:30:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 100 letters. Loop has 38 letters. [2022-02-21 04:30:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 100 letters. Loop has 38 letters. [2022-02-21 04:30:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 100 letters. Loop has 38 letters. [2022-02-21 04:30:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 99 letters. Loop has 37 letters. [2022-02-21 04:30:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 99 letters. Loop has 37 letters. [2022-02-21 04:30:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 99 letters. Loop has 37 letters. [2022-02-21 04:30:29,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 98 letters. Loop has 37 letters. [2022-02-21 04:30:29,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 37 letters. [2022-02-21 04:30:29,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 98 letters. Loop has 37 letters. [2022-02-21 04:30:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 97 letters. Loop has 37 letters. [2022-02-21 04:30:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 37 letters. [2022-02-21 04:30:29,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 97 letters. Loop has 37 letters. [2022-02-21 04:30:29,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 96 letters. Loop has 37 letters. [2022-02-21 04:30:29,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 37 letters. [2022-02-21 04:30:29,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 96 letters. Loop has 37 letters. [2022-02-21 04:30:29,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 95 letters. Loop has 37 letters. [2022-02-21 04:30:29,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 37 letters. [2022-02-21 04:30:29,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 95 letters. Loop has 37 letters. [2022-02-21 04:30:29,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 94 letters. Loop has 37 letters. [2022-02-21 04:30:29,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 37 letters. [2022-02-21 04:30:29,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 94 letters. Loop has 37 letters. [2022-02-21 04:30:29,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 93 letters. Loop has 37 letters. [2022-02-21 04:30:29,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 37 letters. [2022-02-21 04:30:29,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 93 letters. Loop has 37 letters. [2022-02-21 04:30:29,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 92 letters. Loop has 37 letters. [2022-02-21 04:30:29,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 37 letters. [2022-02-21 04:30:29,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 92 letters. Loop has 37 letters. [2022-02-21 04:30:29,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 90 letters. Loop has 37 letters. [2022-02-21 04:30:29,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 37 letters. [2022-02-21 04:30:29,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 90 letters. Loop has 37 letters. [2022-02-21 04:30:29,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 89 letters. Loop has 37 letters. [2022-02-21 04:30:29,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 37 letters. [2022-02-21 04:30:29,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 89 letters. Loop has 37 letters. [2022-02-21 04:30:29,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:29,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:30:29,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:29,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,985 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:30:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:30:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2022-02-21 04:30:29,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 37 letters. [2022-02-21 04:30:29,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 93 letters. Loop has 37 letters. [2022-02-21 04:30:29,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 74 letters. [2022-02-21 04:30:29,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:29,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 446 transitions. cyclomatic complexity: 140 [2022-02-21 04:30:29,996 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:30:29,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 0 states and 0 transitions. [2022-02-21 04:30:29,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:30:29,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:30:29,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:30:29,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:29,997 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:29,997 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:29,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:29,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:29,998 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:30:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:29,998 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:30:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:30:29,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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:30:30,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:30,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:30:30,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:30:30,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:30:30,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:30:30,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:30:30,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:30:30,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:30,067 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:30,067 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:30,067 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:30,067 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:30:30,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:30:30,068 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:30:30,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:30:30,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:30:30 BoogieIcfgContainer [2022-02-21 04:30:30,072 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:30:30,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:30:30,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:30:30,073 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:30:30,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:30:19" (3/4) ... [2022-02-21 04:30:30,075 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:30:30,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:30:30,076 INFO L158 Benchmark]: Toolchain (without parser) took 11509.28ms. Allocated memory was 113.2MB in the beginning and 205.5MB in the end (delta: 92.3MB). Free memory was 79.6MB in the beginning and 94.4MB in the end (delta: -14.8MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2022-02-21 04:30:30,077 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:30:30,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.44ms. Allocated memory is still 113.2MB. Free memory was 79.4MB in the beginning and 81.5MB in the end (delta: -2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:30:30,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 113.2MB. Free memory was 81.5MB in the beginning and 77.8MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:30:30,080 INFO L158 Benchmark]: Boogie Preprocessor took 21.53ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 75.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:30:30,080 INFO L158 Benchmark]: RCFGBuilder took 546.61ms. Allocated memory is still 113.2MB. Free memory was 75.2MB in the beginning and 46.4MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-02-21 04:30:30,080 INFO L158 Benchmark]: BuchiAutomizer took 10608.40ms. Allocated memory was 113.2MB in the beginning and 205.5MB in the end (delta: 92.3MB). Free memory was 46.4MB in the beginning and 94.4MB in the end (delta: -48.0MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2022-02-21 04:30:30,081 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 205.5MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:30:30,084 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.44ms. Allocated memory is still 113.2MB. Free memory was 79.4MB in the beginning and 81.5MB in the end (delta: -2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 113.2MB. Free memory was 81.5MB in the beginning and 77.8MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.53ms. Allocated memory is still 113.2MB. Free memory was 77.8MB in the beginning and 75.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 546.61ms. Allocated memory is still 113.2MB. Free memory was 75.2MB in the beginning and 46.4MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 10608.40ms. Allocated memory was 113.2MB in the beginning and 205.5MB in the end (delta: 92.3MB). Free memory was 46.4MB in the beginning and 94.4MB in the end (delta: -48.0MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 205.5MB. Free memory is still 94.4MB. 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 + 27 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 10.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. Construction of modules took 0.0s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 182 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 2095 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1316 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 779 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital237 mio100 ax100 hnf100 lsp52 ukn89 mio100 lsp100 div127 bol100 ite100 ukn100 eq196 hnf89 smp86 dnf548 smp65 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 66ms VariablesStem: 0 VariablesLoop: 38 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:30:30,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE