./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:32:24,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:32:24,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:32:24,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:32:24,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:32:24,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:32:24,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:32:24,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:32:24,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:32:24,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:32:24,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:32:24,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:32:24,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:32:24,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:32:24,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:32:24,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:32:24,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:32:24,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:32:24,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:32:24,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:32:24,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:32:24,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:32:24,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:32:24,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:32:24,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:32:24,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:32:24,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:32:24,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:32:24,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:32:24,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:32:24,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:32:24,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:32:24,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:32:24,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:32:24,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:32:24,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:32:24,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:32:24,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:32:24,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:32:24,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:32:24,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:32:24,937 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 13:32:24,968 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:32:24,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:32:24,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:32:24,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:32:24,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:32:24,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:32:24,971 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:32:24,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:32:24,971 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:32:24,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:32:24,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:32:24,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:32:24,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:32:24,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:32:24,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:32:24,973 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:32:24,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:32:24,973 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:32:24,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:32:24,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:32:24,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:32:24,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:32:24,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:32:24,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:32:24,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:32:24,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:32:24,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:32:24,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:32:24,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:32:24,976 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:32:24,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:32:24,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:32:24,977 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G 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(G ! call(reach_error())) ) 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 -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2021-11-23 13:32:25,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:32:25,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:32:25,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:32:25,306 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:32:25,307 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:32:25,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-11-23 13:32:25,382 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/data/52623a222/42fd4ae61e9d414ca7f401f74c75a1fb/FLAG37c04d1f1 [2021-11-23 13:32:26,046 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:32:26,051 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-11-23 13:32:26,068 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/data/52623a222/42fd4ae61e9d414ca7f401f74c75a1fb/FLAG37c04d1f1 [2021-11-23 13:32:26,366 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/data/52623a222/42fd4ae61e9d414ca7f401f74c75a1fb [2021-11-23 13:32:26,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:32:26,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:32:26,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:32:26,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:32:26,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:32:26,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fcefc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26, skipping insertion in model container [2021-11-23 13:32:26,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:32:26,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:32:26,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2021-11-23 13:32:26,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:32:26,702 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:32:26,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2021-11-23 13:32:26,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:32:26,769 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:32:26,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26 WrapperNode [2021-11-23 13:32:26,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:32:26,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:32:26,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:32:26,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:32:26,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,834 INFO L137 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 32, calls inlined = 49, statements flattened = 620 [2021-11-23 13:32:26,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:32:26,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:32:26,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:32:26,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:32:26,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:32:26,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:32:26,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:32:26,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:32:26,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (1/1) ... [2021-11-23 13:32:26,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:32:26,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:32:26,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:32:26,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:32:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:32:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:32:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:32:26,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:32:27,070 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:32:27,072 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:32:27,766 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:32:27,778 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:32:27,778 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-23 13:32:27,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:27 BoogieIcfgContainer [2021-11-23 13:32:27,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:32:27,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:32:27,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:32:27,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:32:27,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:32:26" (1/3) ... [2021-11-23 13:32:27,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4b20d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:32:27, skipping insertion in model container [2021-11-23 13:32:27,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:26" (2/3) ... [2021-11-23 13:32:27,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4b20d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:32:27, skipping insertion in model container [2021-11-23 13:32:27,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:27" (3/3) ... [2021-11-23 13:32:27,793 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-11-23 13:32:27,799 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:32:27,800 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 13:32:27,861 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:32:27,869 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 13:32:27,870 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 13:32:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 230 states have (on average 1.5391304347826087) internal successors, (354), 231 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 13:32:27,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:27,907 INFO L514 BasicCegarLoop]: trace 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] [2021-11-23 13:32:27,908 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1161968256, now seen corresponding path program 1 times [2021-11-23 13:32:27,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:27,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918287583] [2021-11-23 13:32:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:27,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:28,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:28,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918287583] [2021-11-23 13:32:28,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918287583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:28,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:28,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:28,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206255919] [2021-11-23 13:32:28,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:28,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:28,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:28,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:28,153 INFO L87 Difference]: Start difference. First operand has 232 states, 230 states have (on average 1.5391304347826087) internal successors, (354), 231 states have internal predecessors, (354), 0 states have call successors, (0), 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 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:28,250 INFO L93 Difference]: Finished difference Result 457 states and 699 transitions. [2021-11-23 13:32:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-23 13:32:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:28,268 INFO L225 Difference]: With dead ends: 457 [2021-11-23 13:32:28,268 INFO L226 Difference]: Without dead ends: 227 [2021-11-23 13:32:28,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:28,278 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 336 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:28,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 340 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-23 13:32:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-11-23 13:32:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.491150442477876) internal successors, (337), 226 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 337 transitions. [2021-11-23 13:32:28,348 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 337 transitions. Word has length 54 [2021-11-23 13:32:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:28,349 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 337 transitions. [2021-11-23 13:32:28,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 337 transitions. [2021-11-23 13:32:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 13:32:28,352 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:28,353 INFO L514 BasicCegarLoop]: trace 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] [2021-11-23 13:32:28,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:32:28,354 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1177486974, now seen corresponding path program 1 times [2021-11-23 13:32:28,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:28,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793235733] [2021-11-23 13:32:28,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:28,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:28,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:28,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793235733] [2021-11-23 13:32:28,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793235733] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:28,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:28,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:32:28,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170161097] [2021-11-23 13:32:28,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:28,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:28,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:28,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:28,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:28,446 INFO L87 Difference]: Start difference. First operand 227 states and 337 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:28,537 INFO L93 Difference]: Finished difference Result 606 states and 900 transitions. [2021-11-23 13:32:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:28,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-23 13:32:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:28,543 INFO L225 Difference]: With dead ends: 606 [2021-11-23 13:32:28,543 INFO L226 Difference]: Without dead ends: 388 [2021-11-23 13:32:28,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:28,547 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 291 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:28,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 606 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-23 13:32:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2021-11-23 13:32:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 570 transitions. [2021-11-23 13:32:28,612 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 570 transitions. Word has length 54 [2021-11-23 13:32:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:28,612 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 570 transitions. [2021-11-23 13:32:28,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 570 transitions. [2021-11-23 13:32:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 13:32:28,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:28,615 INFO L514 BasicCegarLoop]: trace 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] [2021-11-23 13:32:28,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 13:32:28,616 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash -766505794, now seen corresponding path program 1 times [2021-11-23 13:32:28,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:28,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610185035] [2021-11-23 13:32:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:28,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:28,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610185035] [2021-11-23 13:32:28,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610185035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:28,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:28,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:28,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050367042] [2021-11-23 13:32:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:28,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:28,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:28,751 INFO L87 Difference]: Start difference. First operand 386 states and 570 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:28,919 INFO L93 Difference]: Finished difference Result 922 states and 1361 transitions. [2021-11-23 13:32:28,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:32:28,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-23 13:32:28,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:28,925 INFO L225 Difference]: With dead ends: 922 [2021-11-23 13:32:28,926 INFO L226 Difference]: Without dead ends: 546 [2021-11-23 13:32:28,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:28,937 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 803 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:28,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [803 Valid, 621 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-11-23 13:32:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 386. [2021-11-23 13:32:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.4727272727272727) internal successors, (567), 385 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 567 transitions. [2021-11-23 13:32:28,997 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 567 transitions. Word has length 54 [2021-11-23 13:32:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:28,997 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 567 transitions. [2021-11-23 13:32:28,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 567 transitions. [2021-11-23 13:32:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 13:32:29,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:29,004 INFO L514 BasicCegarLoop]: trace 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] [2021-11-23 13:32:29,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:32:29,005 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:29,005 INFO L85 PathProgramCache]: Analyzing trace with hash 126980544, now seen corresponding path program 1 times [2021-11-23 13:32:29,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:29,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66538274] [2021-11-23 13:32:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:29,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:29,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:29,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66538274] [2021-11-23 13:32:29,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66538274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:29,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:29,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:29,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202116641] [2021-11-23 13:32:29,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:29,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:29,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:29,102 INFO L87 Difference]: Start difference. First operand 386 states and 567 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:29,218 INFO L93 Difference]: Finished difference Result 920 states and 1351 transitions. [2021-11-23 13:32:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:32:29,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-23 13:32:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:29,223 INFO L225 Difference]: With dead ends: 920 [2021-11-23 13:32:29,223 INFO L226 Difference]: Without dead ends: 545 [2021-11-23 13:32:29,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:29,225 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 599 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:29,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [599 Valid, 810 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-11-23 13:32:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 386. [2021-11-23 13:32:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.464935064935065) internal successors, (564), 385 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 564 transitions. [2021-11-23 13:32:29,258 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 564 transitions. Word has length 54 [2021-11-23 13:32:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:29,258 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 564 transitions. [2021-11-23 13:32:29,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 564 transitions. [2021-11-23 13:32:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 13:32:29,260 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:29,261 INFO L514 BasicCegarLoop]: trace 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] [2021-11-23 13:32:29,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 13:32:29,261 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:29,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1922407298, now seen corresponding path program 1 times [2021-11-23 13:32:29,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:29,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120512007] [2021-11-23 13:32:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:29,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:29,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:29,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120512007] [2021-11-23 13:32:29,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120512007] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:29,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:29,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:29,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805485145] [2021-11-23 13:32:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:29,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:29,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:29,308 INFO L87 Difference]: Start difference. First operand 386 states and 564 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:29,422 INFO L93 Difference]: Finished difference Result 893 states and 1305 transitions. [2021-11-23 13:32:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:32:29,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-23 13:32:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:29,427 INFO L225 Difference]: With dead ends: 893 [2021-11-23 13:32:29,427 INFO L226 Difference]: Without dead ends: 520 [2021-11-23 13:32:29,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:29,430 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 558 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:29,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [558 Valid, 736 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-11-23 13:32:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 386. [2021-11-23 13:32:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.457142857142857) internal successors, (561), 385 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 561 transitions. [2021-11-23 13:32:29,463 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 561 transitions. Word has length 54 [2021-11-23 13:32:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:29,463 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 561 transitions. [2021-11-23 13:32:29,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 561 transitions. [2021-11-23 13:32:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 13:32:29,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:29,465 INFO L514 BasicCegarLoop]: trace 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] [2021-11-23 13:32:29,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 13:32:29,466 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:29,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1674260804, now seen corresponding path program 1 times [2021-11-23 13:32:29,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:29,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980319252] [2021-11-23 13:32:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:29,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:29,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980319252] [2021-11-23 13:32:29,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980319252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:29,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:29,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:32:29,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822410029] [2021-11-23 13:32:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:29,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:29,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:29,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:29,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:29,510 INFO L87 Difference]: Start difference. First operand 386 states and 561 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:29,565 INFO L93 Difference]: Finished difference Result 758 states and 1104 transitions. [2021-11-23 13:32:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-23 13:32:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:29,569 INFO L225 Difference]: With dead ends: 758 [2021-11-23 13:32:29,569 INFO L226 Difference]: Without dead ends: 386 [2021-11-23 13:32:29,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:29,571 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 274 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:29,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 337 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-11-23 13:32:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2021-11-23 13:32:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.4155844155844155) internal successors, (545), 385 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 545 transitions. [2021-11-23 13:32:29,601 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 545 transitions. Word has length 54 [2021-11-23 13:32:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:29,602 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 545 transitions. [2021-11-23 13:32:29,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 545 transitions. [2021-11-23 13:32:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 13:32:29,603 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:29,603 INFO L514 BasicCegarLoop]: trace 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] [2021-11-23 13:32:29,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 13:32:29,604 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:29,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 350767229, now seen corresponding path program 1 times [2021-11-23 13:32:29,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:29,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748793464] [2021-11-23 13:32:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:29,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:29,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:29,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748793464] [2021-11-23 13:32:29,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748793464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:29,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:29,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:32:29,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290191166] [2021-11-23 13:32:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:29,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:29,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:29,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:29,643 INFO L87 Difference]: Start difference. First operand 386 states and 545 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:29,728 INFO L93 Difference]: Finished difference Result 1081 states and 1526 transitions. [2021-11-23 13:32:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:29,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-23 13:32:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:29,733 INFO L225 Difference]: With dead ends: 1081 [2021-11-23 13:32:29,733 INFO L226 Difference]: Without dead ends: 711 [2021-11-23 13:32:29,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:29,735 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 278 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:29,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 555 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-11-23 13:32:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 671. [2021-11-23 13:32:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 1.3985074626865672) internal successors, (937), 670 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 937 transitions. [2021-11-23 13:32:29,781 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 937 transitions. Word has length 54 [2021-11-23 13:32:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:29,781 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 937 transitions. [2021-11-23 13:32:29,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 937 transitions. [2021-11-23 13:32:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 13:32:29,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:29,783 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:29,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 13:32:29,784 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:29,785 INFO L85 PathProgramCache]: Analyzing trace with hash 458859939, now seen corresponding path program 1 times [2021-11-23 13:32:29,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:29,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659066768] [2021-11-23 13:32:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:29,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:32:29,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:29,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659066768] [2021-11-23 13:32:29,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659066768] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:29,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:29,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:32:29,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75681951] [2021-11-23 13:32:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:29,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:32:29,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:29,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:32:29,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:29,859 INFO L87 Difference]: Start difference. First operand 671 states and 937 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:30,161 INFO L93 Difference]: Finished difference Result 1935 states and 2706 transitions. [2021-11-23 13:32:30,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:32:30,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-23 13:32:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:30,172 INFO L225 Difference]: With dead ends: 1935 [2021-11-23 13:32:30,172 INFO L226 Difference]: Without dead ends: 1284 [2021-11-23 13:32:30,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:32:30,175 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 973 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:30,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [973 Valid, 1498 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2021-11-23 13:32:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 698. [2021-11-23 13:32:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.3715925394548063) internal successors, (956), 697 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 956 transitions. [2021-11-23 13:32:30,256 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 956 transitions. Word has length 87 [2021-11-23 13:32:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:30,258 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 956 transitions. [2021-11-23 13:32:30,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 956 transitions. [2021-11-23 13:32:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 13:32:30,266 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:30,269 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:30,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 13:32:30,269 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1435432351, now seen corresponding path program 1 times [2021-11-23 13:32:30,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:30,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450509386] [2021-11-23 13:32:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:30,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:32:30,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:30,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450509386] [2021-11-23 13:32:30,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450509386] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:30,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:30,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:32:30,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396692507] [2021-11-23 13:32:30,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:30,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:32:30,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:30,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:32:30,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:30,382 INFO L87 Difference]: Start difference. First operand 698 states and 956 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:30,691 INFO L93 Difference]: Finished difference Result 2436 states and 3344 transitions. [2021-11-23 13:32:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:32:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-23 13:32:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:30,707 INFO L225 Difference]: With dead ends: 2436 [2021-11-23 13:32:30,707 INFO L226 Difference]: Without dead ends: 1765 [2021-11-23 13:32:30,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:32:30,714 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 821 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:30,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [821 Valid, 1666 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2021-11-23 13:32:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 749. [2021-11-23 13:32:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 1.3462566844919786) internal successors, (1007), 748 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1007 transitions. [2021-11-23 13:32:30,826 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1007 transitions. Word has length 87 [2021-11-23 13:32:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:30,826 INFO L470 AbstractCegarLoop]: Abstraction has 749 states and 1007 transitions. [2021-11-23 13:32:30,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1007 transitions. [2021-11-23 13:32:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 13:32:30,828 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:30,828 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:30,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 13:32:30,829 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2114704605, now seen corresponding path program 1 times [2021-11-23 13:32:30,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:30,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316520446] [2021-11-23 13:32:30,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:30,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:32:30,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:30,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316520446] [2021-11-23 13:32:30,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316520446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:30,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:30,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:32:30,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223604889] [2021-11-23 13:32:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:30,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:32:30,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:30,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:32:30,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:30,926 INFO L87 Difference]: Start difference. First operand 749 states and 1007 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:31,172 INFO L93 Difference]: Finished difference Result 2063 states and 2775 transitions. [2021-11-23 13:32:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:32:31,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-23 13:32:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:31,181 INFO L225 Difference]: With dead ends: 2063 [2021-11-23 13:32:31,181 INFO L226 Difference]: Without dead ends: 1351 [2021-11-23 13:32:31,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:32:31,184 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 672 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:31,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 1030 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-11-23 13:32:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 761. [2021-11-23 13:32:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 760 states have (on average 1.3236842105263158) internal successors, (1006), 760 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1006 transitions. [2021-11-23 13:32:31,286 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1006 transitions. Word has length 87 [2021-11-23 13:32:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:31,286 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 1006 transitions. [2021-11-23 13:32:31,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1006 transitions. [2021-11-23 13:32:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 13:32:31,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:31,288 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:31,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 13:32:31,289 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 161234649, now seen corresponding path program 1 times [2021-11-23 13:32:31,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:31,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365209108] [2021-11-23 13:32:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:31,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:32:31,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:31,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365209108] [2021-11-23 13:32:31,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365209108] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:31,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:31,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:31,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247303746] [2021-11-23 13:32:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:31,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:31,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:31,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:31,334 INFO L87 Difference]: Start difference. First operand 761 states and 1006 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:31,529 INFO L93 Difference]: Finished difference Result 1801 states and 2382 transitions. [2021-11-23 13:32:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:32:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-23 13:32:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:31,537 INFO L225 Difference]: With dead ends: 1801 [2021-11-23 13:32:31,537 INFO L226 Difference]: Without dead ends: 1081 [2021-11-23 13:32:31,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:31,539 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 748 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:31,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 543 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-11-23 13:32:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 761. [2021-11-23 13:32:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 760 states have (on average 1.311842105263158) internal successors, (997), 760 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 997 transitions. [2021-11-23 13:32:31,633 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 997 transitions. Word has length 87 [2021-11-23 13:32:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:31,634 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 997 transitions. [2021-11-23 13:32:31,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 997 transitions. [2021-11-23 13:32:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 13:32:31,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:31,636 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:31,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 13:32:31,636 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1699574679, now seen corresponding path program 1 times [2021-11-23 13:32:31,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:31,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296861135] [2021-11-23 13:32:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:31,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:32:31,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:31,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296861135] [2021-11-23 13:32:31,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296861135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:31,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:31,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:31,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217703475] [2021-11-23 13:32:31,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:31,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:31,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:31,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:31,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:31,680 INFO L87 Difference]: Start difference. First operand 761 states and 997 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:31,931 INFO L93 Difference]: Finished difference Result 1925 states and 2512 transitions. [2021-11-23 13:32:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:32:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-23 13:32:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:31,939 INFO L225 Difference]: With dead ends: 1925 [2021-11-23 13:32:31,939 INFO L226 Difference]: Without dead ends: 1206 [2021-11-23 13:32:31,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:31,941 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 621 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:31,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 778 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2021-11-23 13:32:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 898. [2021-11-23 13:32:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 1.2809364548494984) internal successors, (1149), 897 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1149 transitions. [2021-11-23 13:32:32,054 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1149 transitions. Word has length 87 [2021-11-23 13:32:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:32,055 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 1149 transitions. [2021-11-23 13:32:32,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1149 transitions. [2021-11-23 13:32:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 13:32:32,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:32,057 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:32,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 13:32:32,058 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash -329011431, now seen corresponding path program 1 times [2021-11-23 13:32:32,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:32,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348162646] [2021-11-23 13:32:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:32,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:32:32,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:32,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348162646] [2021-11-23 13:32:32,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348162646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:32,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:32,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:32,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239414040] [2021-11-23 13:32:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:32,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:32,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:32,124 INFO L87 Difference]: Start difference. First operand 898 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:32,342 INFO L93 Difference]: Finished difference Result 1875 states and 2393 transitions. [2021-11-23 13:32:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:32:32,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-23 13:32:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:32,349 INFO L225 Difference]: With dead ends: 1875 [2021-11-23 13:32:32,349 INFO L226 Difference]: Without dead ends: 1019 [2021-11-23 13:32:32,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:32,352 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 596 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:32,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 544 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-11-23 13:32:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 838. [2021-11-23 13:32:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2425328554360813) internal successors, (1040), 837 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1040 transitions. [2021-11-23 13:32:32,459 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1040 transitions. Word has length 87 [2021-11-23 13:32:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:32,460 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1040 transitions. [2021-11-23 13:32:32,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1040 transitions. [2021-11-23 13:32:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 13:32:32,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:32,462 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:32,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 13:32:32,462 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash -810091689, now seen corresponding path program 1 times [2021-11-23 13:32:32,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:32,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772569886] [2021-11-23 13:32:32,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:32,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:32,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:32,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772569886] [2021-11-23 13:32:32,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772569886] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:32,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:32,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:32,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43600824] [2021-11-23 13:32:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:32,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:32,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:32,526 INFO L87 Difference]: Start difference. First operand 838 states and 1040 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:32,915 INFO L93 Difference]: Finished difference Result 2672 states and 3329 transitions. [2021-11-23 13:32:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:32:32,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-23 13:32:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:32,929 INFO L225 Difference]: With dead ends: 2672 [2021-11-23 13:32:32,929 INFO L226 Difference]: Without dead ends: 1866 [2021-11-23 13:32:32,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:32,932 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 578 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:32,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 773 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2021-11-23 13:32:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1467. [2021-11-23 13:32:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 1.2401091405184175) internal successors, (1818), 1466 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1818 transitions. [2021-11-23 13:32:33,135 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1818 transitions. Word has length 87 [2021-11-23 13:32:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:33,136 INFO L470 AbstractCegarLoop]: Abstraction has 1467 states and 1818 transitions. [2021-11-23 13:32:33,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1818 transitions. [2021-11-23 13:32:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 13:32:33,138 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:33,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:33,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 13:32:33,139 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1252544204, now seen corresponding path program 1 times [2021-11-23 13:32:33,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:33,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940912974] [2021-11-23 13:32:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:33,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:33,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:33,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940912974] [2021-11-23 13:32:33,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940912974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:33,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:33,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:33,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199831523] [2021-11-23 13:32:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:33,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:33,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:33,182 INFO L87 Difference]: Start difference. First operand 1467 states and 1818 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:33,540 INFO L93 Difference]: Finished difference Result 4105 states and 5080 transitions. [2021-11-23 13:32:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:33,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-23 13:32:33,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:33,558 INFO L225 Difference]: With dead ends: 4105 [2021-11-23 13:32:33,559 INFO L226 Difference]: Without dead ends: 2705 [2021-11-23 13:32:33,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:33,566 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 169 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:33,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 517 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2021-11-23 13:32:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2703. [2021-11-23 13:32:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 2702 states have (on average 1.2227979274611398) internal successors, (3304), 2702 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3304 transitions. [2021-11-23 13:32:33,907 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3304 transitions. Word has length 87 [2021-11-23 13:32:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:33,908 INFO L470 AbstractCegarLoop]: Abstraction has 2703 states and 3304 transitions. [2021-11-23 13:32:33,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3304 transitions. [2021-11-23 13:32:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 13:32:33,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:33,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:33,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 13:32:33,912 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1606581885, now seen corresponding path program 1 times [2021-11-23 13:32:33,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394940722] [2021-11-23 13:32:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:33,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:33,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:33,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394940722] [2021-11-23 13:32:33,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394940722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:33,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:33,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:33,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006736180] [2021-11-23 13:32:33,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:33,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:33,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:33,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:33,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:33,966 INFO L87 Difference]: Start difference. First operand 2703 states and 3304 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:34,534 INFO L93 Difference]: Finished difference Result 7563 states and 9260 transitions. [2021-11-23 13:32:34,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:34,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-11-23 13:32:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:34,566 INFO L225 Difference]: With dead ends: 7563 [2021-11-23 13:32:34,566 INFO L226 Difference]: Without dead ends: 4927 [2021-11-23 13:32:34,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:34,572 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 170 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:34,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 601 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2021-11-23 13:32:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4925. [2021-11-23 13:32:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4925 states, 4924 states have (on average 1.2164906580016246) internal successors, (5990), 4924 states have internal predecessors, (5990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 5990 transitions. [2021-11-23 13:32:35,098 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 5990 transitions. Word has length 88 [2021-11-23 13:32:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:35,099 INFO L470 AbstractCegarLoop]: Abstraction has 4925 states and 5990 transitions. [2021-11-23 13:32:35,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 5990 transitions. [2021-11-23 13:32:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 13:32:35,102 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:35,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:35,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 13:32:35,103 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1121627461, now seen corresponding path program 1 times [2021-11-23 13:32:35,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:35,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126384622] [2021-11-23 13:32:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:35,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:32:35,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:35,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126384622] [2021-11-23 13:32:35,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126384622] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:35,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:35,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:35,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449115778] [2021-11-23 13:32:35,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:35,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:35,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:35,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:35,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:35,128 INFO L87 Difference]: Start difference. First operand 4925 states and 5990 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:35,597 INFO L93 Difference]: Finished difference Result 9723 states and 11839 transitions. [2021-11-23 13:32:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:35,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-11-23 13:32:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:35,623 INFO L225 Difference]: With dead ends: 9723 [2021-11-23 13:32:35,623 INFO L226 Difference]: Without dead ends: 4865 [2021-11-23 13:32:35,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:35,630 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 278 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:35,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 283 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2021-11-23 13:32:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4865. [2021-11-23 13:32:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4865 states, 4864 states have (on average 1.2177220394736843) internal successors, (5923), 4864 states have internal predecessors, (5923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4865 states to 4865 states and 5923 transitions. [2021-11-23 13:32:36,221 INFO L78 Accepts]: Start accepts. Automaton has 4865 states and 5923 transitions. Word has length 88 [2021-11-23 13:32:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:36,222 INFO L470 AbstractCegarLoop]: Abstraction has 4865 states and 5923 transitions. [2021-11-23 13:32:36,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4865 states and 5923 transitions. [2021-11-23 13:32:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-23 13:32:36,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:36,226 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:36,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 13:32:36,227 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1288281494, now seen corresponding path program 1 times [2021-11-23 13:32:36,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:36,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307767126] [2021-11-23 13:32:36,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:36,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:36,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:36,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307767126] [2021-11-23 13:32:36,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307767126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:36,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:36,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:32:36,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512214274] [2021-11-23 13:32:36,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:36,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:36,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:36,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:36,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:36,282 INFO L87 Difference]: Start difference. First operand 4865 states and 5923 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:37,125 INFO L93 Difference]: Finished difference Result 13819 states and 16777 transitions. [2021-11-23 13:32:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:32:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-23 13:32:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:37,169 INFO L225 Difference]: With dead ends: 13819 [2021-11-23 13:32:37,169 INFO L226 Difference]: Without dead ends: 6903 [2021-11-23 13:32:37,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:37,182 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 770 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:37,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 972 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2021-11-23 13:32:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6901. [2021-11-23 13:32:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6901 states, 6900 states have (on average 1.1979710144927536) internal successors, (8266), 6900 states have internal predecessors, (8266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6901 states to 6901 states and 8266 transitions. [2021-11-23 13:32:37,936 INFO L78 Accepts]: Start accepts. Automaton has 6901 states and 8266 transitions. Word has length 89 [2021-11-23 13:32:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:37,936 INFO L470 AbstractCegarLoop]: Abstraction has 6901 states and 8266 transitions. [2021-11-23 13:32:37,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 6901 states and 8266 transitions. [2021-11-23 13:32:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 13:32:37,943 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:37,943 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:37,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 13:32:37,944 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1574873378, now seen corresponding path program 1 times [2021-11-23 13:32:37,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:37,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485704199] [2021-11-23 13:32:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:37,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:37,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:37,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485704199] [2021-11-23 13:32:37,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485704199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:37,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:37,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:32:37,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288417329] [2021-11-23 13:32:37,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:37,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:37,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:37,990 INFO L87 Difference]: Start difference. First operand 6901 states and 8266 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:39,159 INFO L93 Difference]: Finished difference Result 16816 states and 20162 transitions. [2021-11-23 13:32:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2021-11-23 13:32:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:39,207 INFO L225 Difference]: With dead ends: 16816 [2021-11-23 13:32:39,207 INFO L226 Difference]: Without dead ends: 9959 [2021-11-23 13:32:39,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:39,223 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 157 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:39,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 506 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9959 states. [2021-11-23 13:32:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9959 to 9909. [2021-11-23 13:32:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9909 states, 9908 states have (on average 1.1903512313282196) internal successors, (11794), 9908 states have internal predecessors, (11794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9909 states to 9909 states and 11794 transitions. [2021-11-23 13:32:40,122 INFO L78 Accepts]: Start accepts. Automaton has 9909 states and 11794 transitions. Word has length 114 [2021-11-23 13:32:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:40,123 INFO L470 AbstractCegarLoop]: Abstraction has 9909 states and 11794 transitions. [2021-11-23 13:32:40,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9909 states and 11794 transitions. [2021-11-23 13:32:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-23 13:32:40,135 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:40,135 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:40,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 13:32:40,136 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -471654896, now seen corresponding path program 1 times [2021-11-23 13:32:40,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:40,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659944726] [2021-11-23 13:32:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:40,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:40,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:40,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659944726] [2021-11-23 13:32:40,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659944726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:40,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:40,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:32:40,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225760189] [2021-11-23 13:32:40,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:40,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:40,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:40,206 INFO L87 Difference]: Start difference. First operand 9909 states and 11794 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:41,209 INFO L93 Difference]: Finished difference Result 16749 states and 19990 transitions. [2021-11-23 13:32:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:32:41,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2021-11-23 13:32:41,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:41,237 INFO L225 Difference]: With dead ends: 16749 [2021-11-23 13:32:41,238 INFO L226 Difference]: Without dead ends: 9915 [2021-11-23 13:32:41,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:41,251 INFO L933 BasicCegarLoop]: 468 mSDtfsCounter, 653 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:41,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 1108 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2021-11-23 13:32:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 9909. [2021-11-23 13:32:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9909 states, 9908 states have (on average 1.186717803794913) internal successors, (11758), 9908 states have internal predecessors, (11758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9909 states to 9909 states and 11758 transitions. [2021-11-23 13:32:42,109 INFO L78 Accepts]: Start accepts. Automaton has 9909 states and 11758 transitions. Word has length 130 [2021-11-23 13:32:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:42,110 INFO L470 AbstractCegarLoop]: Abstraction has 9909 states and 11758 transitions. [2021-11-23 13:32:42,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 9909 states and 11758 transitions. [2021-11-23 13:32:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-23 13:32:42,124 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:42,124 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:42,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 13:32:42,124 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1602999998, now seen corresponding path program 1 times [2021-11-23 13:32:42,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071397227] [2021-11-23 13:32:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:42,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 13:32:42,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:42,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071397227] [2021-11-23 13:32:42,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071397227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:42,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:42,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 13:32:42,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398773191] [2021-11-23 13:32:42,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:42,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:32:42,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:42,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:32:42,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 13:32:42,188 INFO L87 Difference]: Start difference. First operand 9909 states and 11758 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:42,803 INFO L93 Difference]: Finished difference Result 13253 states and 15766 transitions. [2021-11-23 13:32:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 13:32:42,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-11-23 13:32:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:42,814 INFO L225 Difference]: With dead ends: 13253 [2021-11-23 13:32:42,814 INFO L226 Difference]: Without dead ends: 3409 [2021-11-23 13:32:42,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-23 13:32:42,832 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1010 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:42,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1010 Valid, 1093 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:32:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2021-11-23 13:32:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 2732. [2021-11-23 13:32:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2732 states, 2731 states have (on average 1.1962651043573782) internal successors, (3267), 2731 states have internal predecessors, (3267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3267 transitions. [2021-11-23 13:32:43,280 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3267 transitions. Word has length 144 [2021-11-23 13:32:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:43,281 INFO L470 AbstractCegarLoop]: Abstraction has 2732 states and 3267 transitions. [2021-11-23 13:32:43,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3267 transitions. [2021-11-23 13:32:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-23 13:32:43,285 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:43,286 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:43,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 13:32:43,286 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash -531814719, now seen corresponding path program 1 times [2021-11-23 13:32:43,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:43,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947386307] [2021-11-23 13:32:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:43,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 13:32:43,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:43,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947386307] [2021-11-23 13:32:43,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947386307] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:43,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:43,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:43,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663817493] [2021-11-23 13:32:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:43,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:43,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:43,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:43,350 INFO L87 Difference]: Start difference. First operand 2732 states and 3267 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:43,799 INFO L93 Difference]: Finished difference Result 5698 states and 6805 transitions. [2021-11-23 13:32:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:32:43,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-11-23 13:32:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:43,810 INFO L225 Difference]: With dead ends: 5698 [2021-11-23 13:32:43,810 INFO L226 Difference]: Without dead ends: 3003 [2021-11-23 13:32:43,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:43,817 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 476 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:43,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 468 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2021-11-23 13:32:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2374. [2021-11-23 13:32:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2373 states have (on average 1.1930046354825117) internal successors, (2831), 2373 states have internal predecessors, (2831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 2831 transitions. [2021-11-23 13:32:44,215 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 2831 transitions. Word has length 153 [2021-11-23 13:32:44,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:44,215 INFO L470 AbstractCegarLoop]: Abstraction has 2374 states and 2831 transitions. [2021-11-23 13:32:44,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 2831 transitions. [2021-11-23 13:32:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 13:32:44,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:44,221 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:44,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 13:32:44,222 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:44,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:44,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1853706405, now seen corresponding path program 1 times [2021-11-23 13:32:44,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:44,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238654865] [2021-11-23 13:32:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:44,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 13:32:44,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:44,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238654865] [2021-11-23 13:32:44,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238654865] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:44,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:44,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:32:44,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840305969] [2021-11-23 13:32:44,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:44,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:32:44,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:44,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:32:44,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:32:44,302 INFO L87 Difference]: Start difference. First operand 2374 states and 2831 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:44,503 INFO L93 Difference]: Finished difference Result 3176 states and 3762 transitions. [2021-11-23 13:32:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:32:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-11-23 13:32:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:44,505 INFO L225 Difference]: With dead ends: 3176 [2021-11-23 13:32:44,505 INFO L226 Difference]: Without dead ends: 292 [2021-11-23 13:32:44,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:44,510 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 513 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:44,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 496 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-23 13:32:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-11-23 13:32:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.0824742268041236) internal successors, (315), 291 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 315 transitions. [2021-11-23 13:32:44,563 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 315 transitions. Word has length 159 [2021-11-23 13:32:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:44,563 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 315 transitions. [2021-11-23 13:32:44,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 315 transitions. [2021-11-23 13:32:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 13:32:44,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:44,566 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:44,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 13:32:44,567 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1409099501, now seen corresponding path program 1 times [2021-11-23 13:32:44,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:44,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951957106] [2021-11-23 13:32:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:44,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:44,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:44,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951957106] [2021-11-23 13:32:44,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951957106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:44,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:44,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:44,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834395824] [2021-11-23 13:32:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:44,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:44,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:44,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:44,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:44,670 INFO L87 Difference]: Start difference. First operand 292 states and 315 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 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) [2021-11-23 13:32:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:44,735 INFO L93 Difference]: Finished difference Result 440 states and 476 transitions. [2021-11-23 13:32:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:44,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 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) Word has length 159 [2021-11-23 13:32:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:44,737 INFO L225 Difference]: With dead ends: 440 [2021-11-23 13:32:44,737 INFO L226 Difference]: Without dead ends: 292 [2021-11-23 13:32:44,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:44,740 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 88 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:44,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-23 13:32:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-11-23 13:32:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.0721649484536082) internal successors, (312), 291 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 312 transitions. [2021-11-23 13:32:44,782 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 312 transitions. Word has length 159 [2021-11-23 13:32:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:44,783 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 312 transitions. [2021-11-23 13:32:44,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 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) [2021-11-23 13:32:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 312 transitions. [2021-11-23 13:32:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-23 13:32:44,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:44,787 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:44,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 13:32:44,788 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1469091453, now seen corresponding path program 1 times [2021-11-23 13:32:44,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:44,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778956774] [2021-11-23 13:32:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:44,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 13:32:44,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:44,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778956774] [2021-11-23 13:32:44,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778956774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:44,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:44,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:44,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183295631] [2021-11-23 13:32:44,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:44,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:44,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:44,843 INFO L87 Difference]: Start difference. First operand 292 states and 312 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:44,901 INFO L93 Difference]: Finished difference Result 459 states and 489 transitions. [2021-11-23 13:32:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:44,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2021-11-23 13:32:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:44,903 INFO L225 Difference]: With dead ends: 459 [2021-11-23 13:32:44,903 INFO L226 Difference]: Without dead ends: 311 [2021-11-23 13:32:44,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:44,905 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 101 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:44,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 286 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-11-23 13:32:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 292. [2021-11-23 13:32:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.0584192439862543) internal successors, (308), 291 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 308 transitions. [2021-11-23 13:32:44,946 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 308 transitions. Word has length 161 [2021-11-23 13:32:44,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:44,947 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 308 transitions. [2021-11-23 13:32:44,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 308 transitions. [2021-11-23 13:32:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-23 13:32:44,949 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:44,950 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:44,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 13:32:44,950 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:44,951 INFO L85 PathProgramCache]: Analyzing trace with hash 504262826, now seen corresponding path program 1 times [2021-11-23 13:32:44,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:44,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518456872] [2021-11-23 13:32:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:44,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:32:44,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:44,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518456872] [2021-11-23 13:32:44,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518456872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:44,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:44,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:32:44,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909256090] [2021-11-23 13:32:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:44,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:32:44,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:32:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:44,998 INFO L87 Difference]: Start difference. First operand 292 states and 308 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 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) [2021-11-23 13:32:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:45,051 INFO L93 Difference]: Finished difference Result 408 states and 429 transitions. [2021-11-23 13:32:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:32:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 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) Word has length 162 [2021-11-23 13:32:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:45,053 INFO L225 Difference]: With dead ends: 408 [2021-11-23 13:32:45,053 INFO L226 Difference]: Without dead ends: 263 [2021-11-23 13:32:45,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:32:45,054 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 57 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:45,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 232 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-11-23 13:32:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2021-11-23 13:32:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.0534351145038168) internal successors, (276), 262 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 276 transitions. [2021-11-23 13:32:45,091 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 276 transitions. Word has length 162 [2021-11-23 13:32:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:45,091 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 276 transitions. [2021-11-23 13:32:45,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 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) [2021-11-23 13:32:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 276 transitions. [2021-11-23 13:32:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-23 13:32:45,093 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:32:45,093 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:32:45,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 13:32:45,094 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:32:45,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:32:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2115781566, now seen corresponding path program 1 times [2021-11-23 13:32:45,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:32:45,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539916803] [2021-11-23 13:32:45,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:32:45,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:32:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:32:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 13:32:45,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:32:45,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539916803] [2021-11-23 13:32:45,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539916803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:32:45,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:32:45,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:32:45,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159286881] [2021-11-23 13:32:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:32:45,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:32:45,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:32:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:32:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:45,208 INFO L87 Difference]: Start difference. First operand 263 states and 276 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:32:45,318 INFO L93 Difference]: Finished difference Result 263 states and 276 transitions. [2021-11-23 13:32:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:32:45,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2021-11-23 13:32:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:32:45,320 INFO L225 Difference]: With dead ends: 263 [2021-11-23 13:32:45,320 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 13:32:45,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:32:45,321 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 90 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:32:45,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 531 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:32:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 13:32:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 13:32:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 13:32:45,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2021-11-23 13:32:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:32:45,323 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 13:32:45,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:32:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 13:32:45,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 13:32:45,326 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 13:32:45,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-23 13:32:45,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 13:34:15,448 INFO L854 garLoopResultBuilder]: At program point L499-1(lines 470 507) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,448 INFO L858 garLoopResultBuilder]: For program point L433(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,449 INFO L858 garLoopResultBuilder]: For program point L433-2(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,449 INFO L858 garLoopResultBuilder]: For program point L433-3(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,449 INFO L858 garLoopResultBuilder]: For program point L433-5(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,449 INFO L858 garLoopResultBuilder]: For program point L433-6(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,449 INFO L858 garLoopResultBuilder]: For program point L433-8(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,449 INFO L858 garLoopResultBuilder]: For program point L433-9(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,450 INFO L858 garLoopResultBuilder]: For program point L433-11(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,450 INFO L858 garLoopResultBuilder]: For program point L433-12(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,450 INFO L858 garLoopResultBuilder]: For program point L433-14(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,450 INFO L858 garLoopResultBuilder]: For program point L433-15(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,450 INFO L858 garLoopResultBuilder]: For program point L433-17(lines 433 437) no Hoare annotation was computed. [2021-11-23 13:34:15,450 INFO L858 garLoopResultBuilder]: For program point L236-1(lines 230 248) no Hoare annotation was computed. [2021-11-23 13:34:15,451 INFO L854 garLoopResultBuilder]: At program point L369-1(lines 340 377) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~t1_st~0 0)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (= ~T2_E~0 ~M_E~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse9 (= ~token~0 ~local~0) .cse10))) [2021-11-23 13:34:15,451 INFO L854 garLoopResultBuilder]: At program point L369-3(lines 340 377) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (not (= ~T2_E~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 (not (= ~E_M~0 1))) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0) .cse8))) [2021-11-23 13:34:15,451 INFO L854 garLoopResultBuilder]: At program point L105-1(lines 93 124) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0))) (let ((.cse16 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse17 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse18 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse26 (= ~t2_pc~0 1)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (not .cse23)) (.cse20 (= ~m_pc~0 0)) (.cse24 (= ~token~0 ~local~0)) (.cse0 (not (= ~T1_E~0 0))) (.cse15 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse1 (= ~t1_i~0 1)) (.cse19 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (<= 2 ~E_2~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse21 (= 0 ~t2_pc~0)) (.cse22 (= ~E_M~0 ~M_E~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse12 (not (= ~T2_E~0 0))) (.cse13 (= ~M_E~0 2)) (.cse14 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse20 .cse21 .cse22 .cse11 .cse23 .cse12 .cse24 .cse13 .cse14) (and .cse0 .cse1 .cse16 .cse17 .cse18 .cse2 .cse4 .cse7 .cse8 .cse9 .cse10 .cse20 .cse12 .cse14) (let ((.cse25 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 .cse25) .cse2 .cse3 .cse4 .cse26 (= ~m_pc~0 1) (<= .cse25 ~token~0) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse24 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse19 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14)))) [2021-11-23 13:34:15,451 INFO L858 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2021-11-23 13:34:15,451 INFO L858 garLoopResultBuilder]: For program point L305(lines 281 333) no Hoare annotation was computed. [2021-11-23 13:34:15,451 INFO L854 garLoopResultBuilder]: At program point L241-1(lines 227 249) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~t1_st~0 0)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (= ~T2_E~0 ~M_E~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 ~M_E~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) .cse9 .cse10 (= ~token~0 ~local~0) .cse11))) [2021-11-23 13:34:15,451 INFO L858 garLoopResultBuilder]: For program point L572(lines 572 581) no Hoare annotation was computed. [2021-11-23 13:34:15,452 INFO L858 garLoopResultBuilder]: For program point L572-2(lines 572 581) no Hoare annotation was computed. [2021-11-23 13:34:15,452 INFO L858 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2021-11-23 13:34:15,452 INFO L858 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-11-23 13:34:15,452 INFO L854 garLoopResultBuilder]: At program point L441-2(lines 416 449) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse10 (= ~T2_E~0 ~M_E~0)) (.cse11 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~m_st~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse14 (= ~token~0 ~local~0) .cse15 .cse16))) [2021-11-23 13:34:15,452 INFO L858 garLoopResultBuilder]: For program point L441-3(lines 441 445) no Hoare annotation was computed. [2021-11-23 13:34:15,452 INFO L854 garLoopResultBuilder]: At program point L441-5(lines 416 449) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0))) (let ((.cse19 (= ~token~0 ~local~0)) (.cse8 (not (= ~E_M~0 0))) (.cse10 (not .cse23)) (.cse14 (not (= ~t1_st~0 0))) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse24 (not (= ~t1_pc~0 1))) (.cse3 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse4 (not (= ~T2_E~0 1))) (.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse9 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~t2_i~0 1)) (.cse20 (= ~m_pc~0 0)) (.cse21 (= 0 ~t2_pc~0)) (.cse22 (= ~E_M~0 ~M_E~0)) (.cse15 (not (= ~T2_E~0 0))) (.cse16 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse17 (= ~M_E~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~t2_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse19 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse22 .cse23 .cse15 .cse19 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse22 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse22 .cse15 .cse16 .cse17 .cse18)))) [2021-11-23 13:34:15,452 INFO L858 garLoopResultBuilder]: For program point L441-6(lines 441 445) no Hoare annotation was computed. [2021-11-23 13:34:15,453 INFO L854 garLoopResultBuilder]: At program point L177(lines 165 179) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~T2_E~0 ~M_E~0)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse10 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8 .cse9 .cse10 .cse11))) [2021-11-23 13:34:15,453 INFO L854 garLoopResultBuilder]: At program point L441-8(lines 416 449) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (not (= ~E_M~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse11 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~t2_st~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 .cse13) .cse2 .cse3 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse13 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse10 .cse12))) [2021-11-23 13:34:15,453 INFO L854 garLoopResultBuilder]: At program point L177-1(lines 165 179) the Hoare annotation is: (let ((.cse17 (= ~t1_st~0 0)) (.cse24 (= 0 ~t2_st~0)) (.cse23 (= ~t1_pc~0 1))) (let ((.cse4 (not .cse23)) (.cse9 (not (= ~E_M~0 0))) (.cse10 (not .cse24)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse6 (not (= ~T2_E~0 1))) (.cse7 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse8 (<= 2 ~E_2~0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~t2_i~0 1)) (.cse18 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_pc~0)) (.cse20 (= ~E_M~0 ~M_E~0)) (.cse21 (not .cse17)) (.cse14 (not (= ~T2_E~0 0))) (.cse22 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2)) (.cse16 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse11 .cse12 .cse13 .cse18 .cse19 .cse20 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~t2_pc~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse22 .cse15 .cse16) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse18 .cse19 .cse20 .cse21 .cse24 .cse14 .cse22 .cse15 .cse16)))) [2021-11-23 13:34:15,453 INFO L858 garLoopResultBuilder]: For program point L441-9(lines 441 445) no Hoare annotation was computed. [2021-11-23 13:34:15,453 INFO L854 garLoopResultBuilder]: At program point L177-2(lines 165 179) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse4 (not (= ~T2_E~0 1))) (.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse11 (not (= ~t1_st~0 0))) (.cse6 (= 0 ~t2_st~0)) (.cse12 (not (= ~T2_E~0 0))) (.cse13 (= ~M_E~0 2)) (.cse14 (not (= ~E_M~0 1)))) (or (let ((.cse3 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 (<= ~token~0 .cse3) .cse4 .cse5 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse3 ~token~0) (not (= ~E_M~0 0)) (not .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse12 .cse14) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 .cse2 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse11 .cse6 .cse12 .cse13 .cse14))) [2021-11-23 13:34:15,453 INFO L854 garLoopResultBuilder]: At program point L177-3(lines 165 179) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse3 (not (= ~T2_E~0 1))) (.cse4 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse5 (<= 2 ~E_2~0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (not (= 0 ~t2_st~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse12 (not (= ~t1_st~0 0))) (.cse13 (not (= ~T2_E~0 0))) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse3 .cse4 .cse5 (= ~t2_pc~0 1) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 1) ~token~0) .cse12 .cse13 .cse14))) [2021-11-23 13:34:15,454 INFO L854 garLoopResultBuilder]: At program point L441-11(lines 416 449) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= 0 ~t2_st~0))) (.cse12 (not (= ~t1_st~0 0))) (.cse15 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse4 (<= 2 ~E_2~0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse7 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse16 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (not (= ~T2_E~0 0))) (.cse14 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 (= ~t2_pc~0 1) (= ~m_pc~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 1) ~token~0) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse4 .cse5 .cse7 .cse16 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse13 .cse14))) [2021-11-23 13:34:15,454 INFO L854 garLoopResultBuilder]: At program point L177-4(lines 165 179) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (not (= ~T2_E~0 1))) (.cse4 (<= 2 ~E_2~0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (not (= ~T2_E~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9 (not (= ~E_M~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse9))) [2021-11-23 13:34:15,454 INFO L858 garLoopResultBuilder]: For program point L441-12(lines 441 445) no Hoare annotation was computed. [2021-11-23 13:34:15,454 INFO L854 garLoopResultBuilder]: At program point L177-5(lines 165 179) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (not (= ~T2_E~0 1))) (.cse4 (<= 2 ~E_2~0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse6 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse11 (not (= ~T2_E~0 0))) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~E_M~0 0)) .cse6 (not (= 0 ~t2_st~0)) .cse7 .cse8 .cse9 .cse10 (not (= ~t1_st~0 0)) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12))) [2021-11-23 13:34:15,454 INFO L854 garLoopResultBuilder]: At program point L441-14(lines 416 449) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 (not (= ~E_M~0 1))) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11))) [2021-11-23 13:34:15,454 INFO L858 garLoopResultBuilder]: For program point L441-15(lines 441 445) no Hoare annotation was computed. [2021-11-23 13:34:15,454 INFO L854 garLoopResultBuilder]: At program point L441-17(lines 416 449) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,454 INFO L854 garLoopResultBuilder]: At program point L178(lines 162 180) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~T2_E~0 ~M_E~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse11 (= ~token~0 ~local~0) .cse12))) [2021-11-23 13:34:15,455 INFO L854 garLoopResultBuilder]: At program point L178-1(lines 162 180) the Hoare annotation is: (let ((.cse20 (= ~t1_pc~0 1)) (.cse25 (= ~t1_st~0 0)) (.cse24 (= 0 ~t2_st~0))) (let ((.cse9 (not (= ~E_M~0 0))) (.cse10 (not .cse24)) (.cse14 (not .cse25)) (.cse16 (= ~token~0 ~local~0)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse19 (not .cse20)) (.cse4 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse5 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse6 (not (= ~T2_E~0 1))) (.cse7 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse8 (<= 2 ~E_2~0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~t2_i~0 1)) (.cse21 (= ~m_pc~0 0)) (.cse22 (= 0 ~t2_pc~0)) (.cse23 (= ~E_M~0 ~M_E~0)) (.cse15 (not (= ~T2_E~0 0))) (.cse17 (= ~M_E~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t2_pc~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse21 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse11 .cse12 .cse13 .cse21 .cse22 .cse23 .cse15 .cse17 .cse18)))) [2021-11-23 13:34:15,455 INFO L854 garLoopResultBuilder]: At program point L178-2(lines 162 180) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse11 (= 0 ~t2_st~0)) (.cse10 (not (= ~t1_st~0 0))) (.cse13 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse4 (not (= ~T2_E~0 1))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse12 (not (= ~T2_E~0 0))) (.cse14 (not (= ~E_M~0 1)))) (or (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 (<= ~token~0 .cse15) .cse3 .cse4 .cse5 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse15 ~token~0) (not (= ~E_M~0 0)) (not .cse11) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse12 .cse14))) [2021-11-23 13:34:15,455 INFO L854 garLoopResultBuilder]: At program point L178-3(lines 162 180) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T2_E~0 1))) (.cse11 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse5 (<= 2 ~E_2~0)) (.cse12 (not (= ~E_M~0 0))) (.cse13 (not (= 0 ~t2_st~0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse10 (not (= ~T2_E~0 0))) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse15) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse11 .cse5 (= ~t2_pc~0 1) (= ~m_pc~0 1) .cse12 .cse13 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse14 .cse10 .cse15))) [2021-11-23 13:34:15,455 INFO L854 garLoopResultBuilder]: At program point L178-4(lines 162 180) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse4 (not (= ~T2_E~0 1))) (.cse5 (<= 2 ~E_2~0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 (not (= ~E_M~0 1))))) [2021-11-23 13:34:15,455 INFO L854 garLoopResultBuilder]: At program point L178-5(lines 162 180) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse4 (not (= ~T2_E~0 1))) (.cse5 (<= 2 ~E_2~0)) (.cse6 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse7 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse12 (not (= ~T2_E~0 0))) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~E_M~0 0)) .cse7 (not (= 0 ~t2_st~0)) .cse8 .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 .cse13))) [2021-11-23 13:34:15,455 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 58) no Hoare annotation was computed. [2021-11-23 13:34:15,455 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 386) no Hoare annotation was computed. [2021-11-23 13:34:15,456 INFO L858 garLoopResultBuilder]: For program point L382-2(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,456 INFO L858 garLoopResultBuilder]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2021-11-23 13:34:15,456 INFO L858 garLoopResultBuilder]: For program point L382-5(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,456 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,456 INFO L858 garLoopResultBuilder]: For program point L185-2(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,456 INFO L854 garLoopResultBuilder]: At program point L119(lines 90 125) the Hoare annotation is: (let ((.cse26 (= 0 ~t2_st~0))) (let ((.cse6 (not .cse26)) (.cse23 (= ~token~0 ~local~0)) (.cse17 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse18 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse19 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse22 (= ~m_pc~0 0)) (.cse15 (= ~t1_pc~0 1)) (.cse21 (= ~t2_pc~0 1)) (.cse5 (not (= ~E_M~0 0))) (.cse0 (not (= ~T1_E~0 0))) (.cse16 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse1 (= ~t1_i~0 1)) (.cse20 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (<= 2 ~E_2~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse24 (= 0 ~t2_pc~0)) (.cse25 (= ~E_M~0 ~M_E~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse12 (not (= ~T2_E~0 0))) (.cse13 (= ~M_E~0 2)) (.cse14 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse16 .cse1 .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse21 .cse5 .cse6 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse23 .cse13 .cse14) (and .cse15 .cse0 .cse16 .cse1 .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse22 .cse24 .cse25 .cse11 .cse26 .cse12 .cse23 .cse13 .cse14) (and .cse0 .cse1 .cse17 .cse18 .cse19 .cse2 .cse4 .cse7 .cse8 .cse9 .cse10 .cse22 .cse12 .cse14) (let ((.cse27 (+ ~local~0 1))) (and .cse15 .cse0 .cse1 (<= ~token~0 .cse27) .cse2 .cse3 .cse4 .cse21 (= ~m_pc~0 1) (<= .cse27 ~token~0) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and .cse0 .cse16 .cse1 .cse20 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14)))) [2021-11-23 13:34:15,457 INFO L858 garLoopResultBuilder]: For program point L185-3(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,457 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2021-11-23 13:34:15,457 INFO L858 garLoopResultBuilder]: For program point L185-5(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,457 INFO L858 garLoopResultBuilder]: For program point L185-6(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,457 INFO L858 garLoopResultBuilder]: For program point L185-8(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,457 INFO L858 garLoopResultBuilder]: For program point L185-9(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,458 INFO L858 garLoopResultBuilder]: For program point L185-11(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,458 INFO L858 garLoopResultBuilder]: For program point L185-12(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,458 INFO L858 garLoopResultBuilder]: For program point L185-14(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,458 INFO L858 garLoopResultBuilder]: For program point L185-15(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,458 INFO L858 garLoopResultBuilder]: For program point L185-17(lines 185 194) no Hoare annotation was computed. [2021-11-23 13:34:15,458 INFO L854 garLoopResultBuilder]: At program point L516(lines 508 518) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-11-23 13:34:15,459 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 191) no Hoare annotation was computed. [2021-11-23 13:34:15,459 INFO L858 garLoopResultBuilder]: For program point L186-1(lines 186 191) no Hoare annotation was computed. [2021-11-23 13:34:15,459 INFO L858 garLoopResultBuilder]: For program point L186-2(lines 186 191) no Hoare annotation was computed. [2021-11-23 13:34:15,459 INFO L858 garLoopResultBuilder]: For program point L186-3(lines 186 191) no Hoare annotation was computed. [2021-11-23 13:34:15,459 INFO L854 garLoopResultBuilder]: At program point L54(lines 49 88) the Hoare annotation is: (and (= ~t1_pc~0 1) (not (= ~T1_E~0 0)) (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) (not (= ~T2_E~0 1)) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~t2_i~0 1) (< (+ ~local~0 1) ~token~0) (not (= ~t1_st~0 0)) (not (= ~T2_E~0 0)) (= ~M_E~0 2) (not (= ~E_M~0 1))) [2021-11-23 13:34:15,459 INFO L858 garLoopResultBuilder]: For program point L186-4(lines 186 191) no Hoare annotation was computed. [2021-11-23 13:34:15,460 INFO L858 garLoopResultBuilder]: For program point L186-5(lines 186 191) no Hoare annotation was computed. [2021-11-23 13:34:15,460 INFO L854 garLoopResultBuilder]: At program point L319(lines 281 333) the Hoare annotation is: (let ((.cse29 (= ~t1_st~0 0)) (.cse14 (= 0 ~t2_st~0)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse19 (not .cse20)) (.cse26 (not .cse14)) (.cse16 (= ~token~0 ~local~0)) (.cse21 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse22 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse23 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse27 (= ~m_pc~0 0)) (.cse24 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse30 (+ ~local~0 1)) (.cse25 (not (= ~E_M~0 0))) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse4 (not (= ~T2_E~0 1))) (.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (<= 2 ~E_2~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse12 (= 0 ~t2_pc~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse28 (not .cse29)) (.cse15 (not (= ~T2_E~0 0))) (.cse17 (= ~M_E~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (and .cse20 .cse0 .cse1 .cse2 .cse21 .cse22 .cse23 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse26 .cse9 .cse10 .cse11 .cse27 .cse28 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse2 .cse21 .cse22 .cse19 .cse23 .cse4 .cse29 .cse6 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse25 (or (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse6 .cse26 .cse8 .cse9 .cse10 .cse11 .cse15 .cse18) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse6 .cse26 .cse8 .cse9 .cse10 .cse11 .cse15 .cse18)) .cse17) (and .cse20 (<= ~token~0 (+ 2 ~local~0)) .cse24 .cse7 .cse25 (< .cse30 ~token~0) .cse28 (or (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse26 .cse9 .cse10 .cse11 .cse15 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse26 .cse9 .cse10 .cse11 .cse15 .cse18)) .cse17) (and .cse0 .cse2 .cse4 .cse6 .cse25 .cse26 .cse8 .cse9 .cse10 .cse11 .cse28 .cse15 .cse18) (and .cse0 .cse1 .cse2 .cse21 .cse22 .cse19 .cse23 .cse3 .cse4 .cse5 .cse29 .cse6 .cse24 .cse25 .cse26 .cse9 .cse10 .cse11 .cse27 .cse15 .cse16 .cse17 .cse18) (and .cse20 .cse0 .cse1 .cse2 .cse21 .cse22 .cse23 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18) (and (or (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse26 .cse8 .cse9 .cse10 .cse11 .cse15 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse26 .cse8 .cse9 .cse10 .cse11 .cse15 .cse18)) .cse24 .cse7 .cse25 .cse16 .cse17) (and .cse0 .cse2 .cse21 .cse22 .cse23 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse27 .cse15 .cse18) (and .cse20 .cse0 .cse2 (<= ~token~0 .cse30) .cse4 .cse5 .cse6 .cse24 .cse7 (<= .cse30 ~token~0) .cse25 .cse8 .cse9 .cse10 .cse11 .cse28 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse15 .cse17 .cse18)))) [2021-11-23 13:34:15,460 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 269) no Hoare annotation was computed. [2021-11-23 13:34:15,460 INFO L858 garLoopResultBuilder]: For program point L254-1(lines 254 269) no Hoare annotation was computed. [2021-11-23 13:34:15,460 INFO L858 garLoopResultBuilder]: For program point L254-2(lines 254 269) no Hoare annotation was computed. [2021-11-23 13:34:15,461 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-11-23 13:34:15,461 INFO L858 garLoopResultBuilder]: For program point L387-1(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,461 INFO L858 garLoopResultBuilder]: For program point L387-3(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,461 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 329) no Hoare annotation was computed. [2021-11-23 13:34:15,461 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 13:34:15,461 INFO L858 garLoopResultBuilder]: For program point L258(lines 258 268) no Hoare annotation was computed. [2021-11-23 13:34:15,461 INFO L858 garLoopResultBuilder]: For program point L258-1(lines 258 268) no Hoare annotation was computed. [2021-11-23 13:34:15,462 INFO L858 garLoopResultBuilder]: For program point L258-2(lines 258 268) no Hoare annotation was computed. [2021-11-23 13:34:15,462 INFO L854 garLoopResultBuilder]: At program point L458(lines 450 460) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0))) (let ((.cse19 (= ~token~0 ~local~0)) (.cse8 (not (= ~E_M~0 0))) (.cse10 (not .cse23)) (.cse14 (not (= ~t1_st~0 0))) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse24 (not (= ~t1_pc~0 1))) (.cse3 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse4 (not (= ~T2_E~0 1))) (.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse9 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~t2_i~0 1)) (.cse20 (= ~m_pc~0 0)) (.cse21 (= 0 ~t2_pc~0)) (.cse22 (= ~E_M~0 ~M_E~0)) (.cse15 (not (= ~T2_E~0 0))) (.cse16 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse17 (= ~M_E~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~t2_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse19 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse22 .cse23 .cse15 .cse19 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse22 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse22 .cse15 .cse16 .cse17 .cse18)))) [2021-11-23 13:34:15,462 INFO L854 garLoopResultBuilder]: At program point L458-1(lines 450 460) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (not (= ~E_M~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse11 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~t2_st~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 .cse13) .cse2 .cse3 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse13 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse10 .cse12))) [2021-11-23 13:34:15,462 INFO L854 garLoopResultBuilder]: At program point L458-2(lines 450 460) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= 0 ~t2_st~0))) (.cse12 (not (= ~t1_st~0 0))) (.cse15 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse4 (<= 2 ~E_2~0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse7 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse16 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (not (= ~T2_E~0 0))) (.cse14 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 (= ~t2_pc~0 1) (= ~m_pc~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 1) ~token~0) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse4 .cse5 .cse7 .cse16 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse13 .cse14))) [2021-11-23 13:34:15,463 INFO L858 garLoopResultBuilder]: For program point L392-1(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,463 INFO L858 garLoopResultBuilder]: For program point L392-3(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,463 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2021-11-23 13:34:15,463 INFO L854 garLoopResultBuilder]: At program point L591(lines 538 596) the Hoare annotation is: (= ~t1_i~0 1) [2021-11-23 13:34:15,463 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 267) no Hoare annotation was computed. [2021-11-23 13:34:15,463 INFO L858 garLoopResultBuilder]: For program point L262-1(lines 262 267) no Hoare annotation was computed. [2021-11-23 13:34:15,464 INFO L854 garLoopResultBuilder]: At program point L196(lines 184 198) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ~T2_E~0 ~M_E~0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse13 (= 0 ~t2_st~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~m_st~0 0)) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse12 .cse13 (= ~token~0 ~local~0) .cse14))) [2021-11-23 13:34:15,464 INFO L858 garLoopResultBuilder]: For program point L262-2(lines 262 267) no Hoare annotation was computed. [2021-11-23 13:34:15,464 INFO L854 garLoopResultBuilder]: At program point L196-1(lines 184 198) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse18 (not .cse0)) (.cse8 (not (= ~E_M~0 0))) (.cse9 (not .cse23)) (.cse19 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse3 (= ~t1_i~0 1)) (.cse4 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse5 (not (= ~T2_E~0 1))) (.cse6 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse7 (<= 2 ~E_2~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 0))) (.cse12 (= ~t2_i~0 1)) (.cse20 (= ~m_pc~0 0)) (.cse21 (= 0 ~t2_pc~0)) (.cse22 (= ~E_M~0 ~M_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse14 (not (= ~T2_E~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2)) (.cse17 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~t2_pc~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse14 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse20 .cse21 .cse22 .cse19 .cse14 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse20 .cse21 .cse22 .cse19 .cse13 .cse14 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse20 .cse21 .cse22 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17)))) [2021-11-23 13:34:15,464 INFO L854 garLoopResultBuilder]: At program point L196-2(lines 184 198) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse11 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse3 (not (= ~m_st~0 0))) (.cse4 (not (= ~E_1~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse13 (not (= ~t1_st~0 0))) (.cse12 (= 0 ~t2_st~0)) (.cse8 (not (= ~T2_E~0 0))) (.cse14 (= ~M_E~0 2)) (.cse9 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8 .cse9) (let ((.cse10 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 .cse10) .cse2 .cse11 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse10 ~token~0) (not (= ~E_M~0 0)) (not .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse14 .cse9)) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse7 .cse13 .cse12 .cse8 .cse14 .cse9))) [2021-11-23 13:34:15,464 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 138) no Hoare annotation was computed. [2021-11-23 13:34:15,465 INFO L854 garLoopResultBuilder]: At program point L196-3(lines 184 198) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (<= 2 ~E_2~0)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (not (= 0 ~t2_st~0))) (.cse14 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse11 (not (= ~t1_st~0 0))) (.cse12 (not (= ~T2_E~0 0))) (.cse13 (= ~M_E~0 2))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 (= ~t2_pc~0 1) (= ~m_pc~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse4 .cse14 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-23 13:34:15,465 INFO L854 garLoopResultBuilder]: At program point L196-4(lines 184 198) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse9 (not (= ~T2_E~0 0)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9 (not (= ~E_M~0 1))))) [2021-11-23 13:34:15,465 INFO L854 garLoopResultBuilder]: At program point L196-5(lines 184 198) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse11 (not (= ~T2_E~0 0))) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_st~0 0)) .cse11 .cse12))) [2021-11-23 13:34:15,465 INFO L858 garLoopResultBuilder]: For program point L527(lines 527 532) no Hoare annotation was computed. [2021-11-23 13:34:15,466 INFO L854 garLoopResultBuilder]: At program point L197(lines 181 199) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ~T2_E~0 ~M_E~0)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~m_pc~0 0)) (.cse13 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse13 .cse14 (= ~token~0 ~local~0) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-11-23 13:34:15,466 INFO L854 garLoopResultBuilder]: At program point L197-1(lines 181 199) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse23 (= 0 ~t2_st~0))) (let ((.cse15 (= ~token~0 ~local~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (not .cse23)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse3 (= ~t1_i~0 1)) (.cse24 (not .cse0)) (.cse4 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse5 (not (= ~T2_E~0 1))) (.cse6 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse7 (<= 2 ~E_2~0)) (.cse18 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 0))) (.cse12 (= ~t2_i~0 1)) (.cse20 (= ~m_pc~0 0)) (.cse21 (= 0 ~t2_pc~0)) (.cse22 (= ~E_M~0 ~M_E~0)) (.cse19 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse14 (not (= ~T2_E~0 0))) (.cse16 (= ~M_E~0 2)) (.cse17 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~t2_pc~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse20 .cse21 .cse22 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse10 .cse11 .cse12 .cse20 .cse21 .cse22 .cse19 .cse13 .cse14 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse14 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse18 .cse10 .cse11 .cse12 .cse20 .cse21 .cse22 .cse19 .cse14 .cse16 .cse17)))) [2021-11-23 13:34:15,466 INFO L854 garLoopResultBuilder]: At program point L197-2(lines 181 199) the Hoare annotation is: (let ((.cse4 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse12 (not (= ~t1_st~0 0))) (.cse6 (= 0 ~t2_st~0)) (.cse14 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse3 (not (= ~T2_E~0 1))) (.cse5 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse13 (not (= ~T2_E~0 0))) (.cse15 (not (= ~E_M~0 1)))) (or (let ((.cse2 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 .cse2) .cse3 .cse4 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse2 ~token~0) .cse5 (not (= ~E_M~0 0)) (not .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse11 .cse12 .cse6 .cse13 .cse14 .cse15) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13 .cse15))) [2021-11-23 13:34:15,466 INFO L854 garLoopResultBuilder]: At program point L197-3(lines 181 199) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse11 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse12 (not (= ~E_M~0 0))) (.cse13 (not (= 0 ~t2_st~0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse10 (not (= ~T2_E~0 0))) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse11 .cse3 (= ~t2_pc~0 1) (= ~m_pc~0 1) .cse4 .cse12 .cse13 .cse6 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) .cse9 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse15))) [2021-11-23 13:34:15,467 INFO L854 garLoopResultBuilder]: At program point L197-4(lines 181 199) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse10 (not (= ~T2_E~0 0)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 (not (= ~E_M~0 1))))) [2021-11-23 13:34:15,467 INFO L854 garLoopResultBuilder]: At program point L197-5(lines 181 199) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse6 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse12 (not (= ~T2_E~0 0))) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~E_M~0 0)) .cse6 (not (= 0 ~t2_st~0)) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) .cse12 .cse13))) [2021-11-23 13:34:15,467 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-23 13:34:15,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-11-23 13:34:15,467 INFO L858 garLoopResultBuilder]: For program point L397-1(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,468 INFO L858 garLoopResultBuilder]: For program point L397-3(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,468 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 137) no Hoare annotation was computed. [2021-11-23 13:34:15,468 INFO L854 garLoopResultBuilder]: At program point L134(lines 129 160) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse3 (not (= ~T2_E~0 1))) (.cse4 (<= 2 ~E_2~0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (not (= ~T2_E~0 0))) (.cse10 (not (= ~E_M~0 1)))) (or (let ((.cse2 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 .cse2) .cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse4 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse2 ~token~0) (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9 (= ~M_E~0 2) .cse10)) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10))) [2021-11-23 13:34:15,468 INFO L854 garLoopResultBuilder]: At program point L334(lines 275 339) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (not (= ~T2_E~0 0))) (.cse9 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9))) [2021-11-23 13:34:15,468 INFO L854 garLoopResultBuilder]: At program point L467(lines 461 469) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,469 INFO L854 garLoopResultBuilder]: At program point L534(lines 523 536) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,469 INFO L858 garLoopResultBuilder]: For program point L402-1(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,469 INFO L858 garLoopResultBuilder]: For program point L402-3(lines 381 414) no Hoare annotation was computed. [2021-11-23 13:34:15,469 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,469 INFO L858 garLoopResultBuilder]: For program point L204-2(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,469 INFO L858 garLoopResultBuilder]: For program point L204-3(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,469 INFO L858 garLoopResultBuilder]: For program point L204-5(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,470 INFO L858 garLoopResultBuilder]: For program point L204-6(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,470 INFO L858 garLoopResultBuilder]: For program point L204-8(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,470 INFO L858 garLoopResultBuilder]: For program point L204-9(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,470 INFO L858 garLoopResultBuilder]: For program point L204-11(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,470 INFO L858 garLoopResultBuilder]: For program point L204-12(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,470 INFO L858 garLoopResultBuilder]: For program point L204-14(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,470 INFO L858 garLoopResultBuilder]: For program point L204-15(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,471 INFO L858 garLoopResultBuilder]: For program point L204-17(lines 204 213) no Hoare annotation was computed. [2021-11-23 13:34:15,471 INFO L854 garLoopResultBuilder]: At program point L535(lines 519 537) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,471 INFO L854 garLoopResultBuilder]: At program point L271(lines 253 273) the Hoare annotation is: (let ((.cse26 (= ~t1_st~0 0)) (.cse24 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse25 (not .cse0)) (.cse10 (= ~t2_pc~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not .cse24)) (.cse29 (+ ~local~0 1)) (.cse17 (not .cse26)) (.cse6 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse8 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse27 (= ~m_pc~0 1)) (.cse22 (= 0 ~t2_pc~0)) (.cse23 (= ~E_M~0 ~M_E~0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~M_E~0 2)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse4 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (not (= ~T2_E~0 1))) (.cse9 (<= 2 ~E_2~0)) (.cse28 (not (= ~m_st~0 0))) (.cse13 (not (= ~E_1~0 1))) (.cse14 (not (= ~E_1~0 0))) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~m_pc~0 0)) (.cse18 (not (= ~T2_E~0 0))) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse17 .cse24 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse6 .cse7 .cse26 .cse9 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse24 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse6 .cse7 .cse9 .cse10 .cse27 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse25 .cse6 .cse7 .cse8 .cse9 .cse28 .cse13 .cse14 .cse15 .cse22 .cse23 .cse18 .cse20 .cse21) (and .cse1 .cse2 .cse25 .cse6 .cse7 .cse9 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse18 .cse20 .cse21) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse29) .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 (<= .cse29 ~token~0) .cse11 .cse28 .cse13 .cse14 .cse15 .cse17 .cse18 .cse20 .cse21) (and .cse1 .cse2 .cse7 .cse9 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse17 .cse18 .cse21) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse6 .cse7 .cse9 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 (< .cse29 ~token~0) .cse17 .cse18 .cse20 .cse21) (and .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse28 .cse13 .cse14 .cse15 .cse22 .cse23 .cse17 .cse18 .cse20 .cse21) (and .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse28 .cse13 .cse14 .cse15 .cse16 .cse18 .cse21)))) [2021-11-23 13:34:15,472 INFO L854 garLoopResultBuilder]: At program point L271-1(lines 253 273) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,472 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 210) no Hoare annotation was computed. [2021-11-23 13:34:15,472 INFO L854 garLoopResultBuilder]: At program point L271-2(lines 253 273) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,472 INFO L858 garLoopResultBuilder]: For program point L205-1(lines 205 210) no Hoare annotation was computed. [2021-11-23 13:34:15,472 INFO L858 garLoopResultBuilder]: For program point L205-2(lines 205 210) no Hoare annotation was computed. [2021-11-23 13:34:15,473 INFO L858 garLoopResultBuilder]: For program point L205-3(lines 205 210) no Hoare annotation was computed. [2021-11-23 13:34:15,473 INFO L858 garLoopResultBuilder]: For program point L205-4(lines 205 210) no Hoare annotation was computed. [2021-11-23 13:34:15,473 INFO L858 garLoopResultBuilder]: For program point L205-5(lines 205 210) no Hoare annotation was computed. [2021-11-23 13:34:15,473 INFO L854 garLoopResultBuilder]: At program point L272(lines 250 274) the Hoare annotation is: (let ((.cse29 (= ~t1_st~0 0)) (.cse20 (= 0 ~t2_st~0)) (.cse22 (= ~t1_pc~0 1))) (let ((.cse30 (+ ~local~0 1)) (.cse3 (not .cse22)) (.cse23 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse24 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse27 (= ~m_pc~0 0)) (.cse26 (= ~t2_pc~0 1)) (.cse17 (= ~m_pc~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (not .cse20)) (.cse21 (= ~token~0 ~local~0)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse4 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse5 (not (= ~T2_E~0 1))) (.cse16 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (<= 2 ~E_2~0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~E_1~0 0))) (.cse12 (= ~t2_i~0 1)) (.cse18 (= 0 ~t2_pc~0)) (.cse19 (= ~E_M~0 ~M_E~0)) (.cse28 (not .cse29)) (.cse13 (not (= ~T2_E~0 0))) (.cse14 (= ~M_E~0 2)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse16 .cse6 .cse17 .cse9 .cse10 .cse11 .cse12 .cse18 .cse19 .cse20 .cse13 .cse21 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse9 .cse10 .cse11 .cse12 .cse18 .cse19 .cse13 .cse14 .cse15) (and .cse22 .cse0 .cse1 .cse2 .cse23 .cse24 .cse25 .cse4 .cse5 .cse16 .cse6 .cse26 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse28 .cse13 .cse21 .cse14 .cse15) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse4 .cse5 .cse16 .cse29 .cse6 .cse26 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse21 .cse14 .cse15) (and .cse22 .cse0 .cse1 .cse2 .cse23 .cse24 .cse25 .cse4 .cse5 .cse16 .cse6 .cse10 .cse11 .cse12 .cse27 .cse18 .cse19 .cse28 .cse20 .cse13 .cse21 .cse14 .cse15) (and .cse22 .cse0 .cse1 .cse2 (<= ~token~0 .cse30) .cse4 .cse5 .cse16 .cse6 .cse26 .cse17 (<= .cse30 ~token~0) .cse7 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15) (and .cse22 .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse5 .cse6 .cse26 .cse17 .cse7 .cse8 .cse10 .cse11 .cse12 (< .cse30 ~token~0) .cse28 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse23 .cse24 .cse3 .cse25 .cse4 .cse5 .cse29 .cse6 .cse10 .cse11 .cse12 .cse27 .cse18 .cse19 .cse20 .cse13 .cse21 .cse14 .cse15) (and .cse0 .cse2 .cse23 .cse24 .cse25 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse26 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse16 .cse6 .cse9 .cse10 .cse11 .cse12 .cse18 .cse19 .cse28 .cse13 .cse14 .cse15)))) [2021-11-23 13:34:15,473 INFO L854 garLoopResultBuilder]: At program point L272-1(lines 250 274) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,474 INFO L854 garLoopResultBuilder]: At program point L272-2(lines 250 274) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,474 INFO L854 garLoopResultBuilder]: At program point L141-1(lines 129 160) the Hoare annotation is: (let ((.cse22 (= ~t1_st~0 0)) (.cse25 (= ~t1_pc~0 1))) (let ((.cse3 (not .cse25)) (.cse17 (= ~m_pc~0 1)) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse4 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse6 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (not (= 0 ~t2_st~0))) (.cse24 (not .cse22)) (.cse18 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse19 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse20 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse21 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse5 (not (= ~T2_E~0 1))) (.cse7 (<= 2 ~E_2~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 1))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~t2_i~0 1)) (.cse23 (= ~m_pc~0 0)) (.cse14 (not (= ~T2_E~0 0))) (.cse16 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse19 .cse20 .cse3 .cse21 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse23 .cse14 .cse18 .cse15 .cse16) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16) (and .cse25 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse5 .cse6 .cse7 (= ~t2_pc~0 1) .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 (< (+ ~local~0 1) ~token~0) .cse24 .cse14 .cse15 .cse16) (and .cse25 .cse0 .cse1 .cse2 .cse19 .cse20 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse23 .cse24 .cse14 .cse18 .cse15 .cse16) (and .cse0 .cse2 .cse19 .cse20 .cse21 .cse5 .cse7 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse16)))) [2021-11-23 13:34:15,474 INFO L854 garLoopResultBuilder]: At program point L75-1(lines 49 88) the Hoare annotation is: (let ((.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse25 (= ~t1_st~0 0))) (let ((.cse21 (= ~t2_pc~0 1)) (.cse15 (not .cse25)) (.cse18 (= ~token~0 ~local~0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse3 (= ~t1_i~0 1)) (.cse24 (not .cse0)) (.cse4 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse5 (not (= ~T2_E~0 1))) (.cse6 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse7 (<= 2 ~E_2~0)) (.cse22 (not (= ~E_M~0 0))) (.cse23 (not .cse16)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~m_pc~0 0)) (.cse17 (not (= ~T2_E~0 0))) (.cse19 (= ~M_E~0 2)) (.cse20 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse5 .cse6 .cse7 .cse21 (= ~m_pc~0 1) .cse22 .cse23 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 1) ~token~0) .cse15 .cse17 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse22 .cse23 .cse8 .cse9 .cse10 .cse11 .cse15 .cse17 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse22 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse22 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse19 .cse20)))) [2021-11-23 13:34:15,475 INFO L858 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2021-11-23 13:34:15,475 INFO L854 garLoopResultBuilder]: At program point L407-1(lines 378 415) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse10 (= ~T2_E~0 ~M_E~0)) (.cse11 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse17 (= ~M_E~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse15 (= ~token~0 ~local~0) .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~m_st~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-23 13:34:15,475 INFO L854 garLoopResultBuilder]: At program point L407-3(lines 378 415) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11 .cse12))) [2021-11-23 13:34:15,475 INFO L854 garLoopResultBuilder]: At program point L606(lines 597 608) the Hoare annotation is: (= ~t1_i~0 1) [2021-11-23 13:34:15,475 INFO L858 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2021-11-23 13:34:15,475 INFO L858 garLoopResultBuilder]: For program point L474-2(lines 473 506) no Hoare annotation was computed. [2021-11-23 13:34:15,476 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2021-11-23 13:34:15,476 INFO L858 garLoopResultBuilder]: For program point L344-2(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,476 INFO L858 garLoopResultBuilder]: For program point L344-3(lines 344 348) no Hoare annotation was computed. [2021-11-23 13:34:15,476 INFO L858 garLoopResultBuilder]: For program point L344-5(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,476 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 473 506) no Hoare annotation was computed. [2021-11-23 13:34:15,476 INFO L854 garLoopResultBuilder]: At program point L215(lines 203 217) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ~T2_E~0 ~M_E~0)) (.cse10 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~m_pc~0 0)) (.cse13 (= 0 ~t2_st~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse13 (= ~token~0 ~local~0) .cse14))) [2021-11-23 13:34:15,477 INFO L854 garLoopResultBuilder]: At program point L215-1(lines 203 217) the Hoare annotation is: (let ((.cse14 (= 0 ~t2_st~0))) (let ((.cse20 (not (= ~t1_pc~0 1))) (.cse11 (= ~m_pc~0 0)) (.cse12 (= 0 ~t2_pc~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse19 (not (= ~t1_st~0 0))) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse4 (not (= ~T2_E~0 1))) (.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (<= 2 ~E_2~0)) (.cse21 (not (= ~E_M~0 0))) (.cse7 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse22 (not .cse14)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse15 (not (= ~T2_E~0 0))) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse19 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~t2_pc~0 1) .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18)))) [2021-11-23 13:34:15,477 INFO L854 garLoopResultBuilder]: At program point L215-2(lines 203 217) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (not (= ~E_M~0 0))) (.cse6 (not (= 0 ~t2_st~0))) (.cse11 (not (= ~t1_st~0 0))) (.cse13 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse12 (not (= ~T2_E~0 0))) (.cse14 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 .cse15) .cse2 .cse3 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse15 ~token~0) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse12 .cse14))) [2021-11-23 13:34:15,477 INFO L854 garLoopResultBuilder]: At program point L215-3(lines 203 217) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (<= 2 ~E_2~0)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse7 (not (= 0 ~t2_st~0))) (.cse14 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse11 (not (= ~t1_st~0 0))) (.cse12 (not (= ~T2_E~0 0))) (.cse13 (= ~M_E~0 2))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 (= ~t2_pc~0 1) (= ~m_pc~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse4 .cse6 .cse14 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-23 13:34:15,478 INFO L854 garLoopResultBuilder]: At program point L83(lines 46 89) the Hoare annotation is: (let ((.cse16 (= 0 ~t2_st~0))) (let ((.cse7 (= ~m_pc~0 1)) (.cse22 (not (= ~E_M~0 0))) (.cse23 (not .cse16)) (.cse18 (= ~token~0 ~local~0)) (.cse25 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse4 (not (= ~T2_E~0 1))) (.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (<= 2 ~E_2~0)) (.cse8 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse9 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 1))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~t2_i~0 1)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse24 (not (= ~t1_st~0 0))) (.cse17 (not (= ~T2_E~0 0))) (.cse19 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse20 (= ~M_E~0 2)) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~t2_pc~0 1) .cse7 .cse8 .cse22 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse17 .cse19 .cse20 .cse21)))) [2021-11-23 13:34:15,478 INFO L854 garLoopResultBuilder]: At program point L215-4(lines 203 217) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (not (= ~T2_E~0 0)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse9) (and .cse0 .cse1 .cse2 .cse3 (not (= ~E_M~0 0)) .cse4 (not (= 0 ~t2_st~0)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9 (not (= ~E_M~0 1))))) [2021-11-23 13:34:15,478 INFO L854 garLoopResultBuilder]: At program point L215-5(lines 203 217) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (not (= ~T2_E~0 0))) (.cse10 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (not (= ~E_M~0 0)) .cse4 (not (= 0 ~t2_st~0)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9 .cse10))) [2021-11-23 13:34:15,478 INFO L858 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2021-11-23 13:34:15,478 INFO L854 garLoopResultBuilder]: At program point L216(lines 200 218) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse10 (= ~T2_E~0 ~M_E~0)) (.cse11 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~m_st~0 0)) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse14 (= ~token~0 ~local~0) .cse15))) [2021-11-23 13:34:15,479 INFO L854 garLoopResultBuilder]: At program point L216-1(lines 200 218) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0))) (let ((.cse19 (not (= ~t1_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse20 (not (= ~E_M~0 0))) (.cse21 (not .cse23)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse2 (= ~t1_i~0 1)) (.cse4 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse5 (not (= ~T2_E~0 1))) (.cse6 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse9 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 0))) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (not (= ~T2_E~0 0))) (.cse22 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse21 .cse10 .cse11 .cse12 .cse19 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (= ~t2_pc~0 1) .cse8 .cse20 .cse9 .cse21 .cse10 .cse11 .cse12 .cse16 .cse22 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse21 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse22 .cse17 .cse18)))) [2021-11-23 13:34:15,479 INFO L854 garLoopResultBuilder]: At program point L216-2(lines 200 218) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse6 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse5 (not (= ~E_M~0 0))) (.cse7 (not (= 0 ~t2_st~0))) (.cse12 (not (= ~t1_st~0 0))) (.cse14 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (not (= ~T2_E~0 0))) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ ~local~0 1))) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 .cse16) .cse2 .cse3 (= ~t2_pc~0 1) (= ~m_pc~0 1) (<= .cse16 ~token~0) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse13 .cse15))) [2021-11-23 13:34:15,479 INFO L854 garLoopResultBuilder]: At program point L216-3(lines 200 218) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= 0 ~t2_st~0))) (.cse12 (not (= ~t1_st~0 0))) (.cse14 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse4 (<= 2 ~E_2~0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse7 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (not (= ~T2_E~0 0)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 (= ~t2_pc~0 1) (= ~m_pc~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 1) ~token~0) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse4 .cse5 .cse7 .cse15 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse13))) [2021-11-23 13:34:15,480 INFO L854 garLoopResultBuilder]: At program point L216-4(lines 200 218) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 (not (= ~E_M~0 1))) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10))) [2021-11-23 13:34:15,480 INFO L854 garLoopResultBuilder]: At program point L216-5(lines 200 218) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (not (= ~T2_E~0 0))) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not (= 0 ~t2_st~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10 .cse11))) [2021-11-23 13:34:15,480 INFO L858 garLoopResultBuilder]: For program point L349-1(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,480 INFO L858 garLoopResultBuilder]: For program point L349-3(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,480 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-23 13:34:15,480 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-11-23 13:34:15,481 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2021-11-23 13:34:15,481 INFO L858 garLoopResultBuilder]: For program point L484-1(lines 473 506) no Hoare annotation was computed. [2021-11-23 13:34:15,481 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2021-11-23 13:34:15,481 INFO L858 garLoopResultBuilder]: For program point L286-1(lines 281 333) no Hoare annotation was computed. [2021-11-23 13:34:15,481 INFO L854 garLoopResultBuilder]: At program point L155(lines 126 161) the Hoare annotation is: (let ((.cse26 (= ~t1_st~0 0)) (.cse21 (= ~t1_pc~0 1))) (let ((.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0))) (.cse3 (not .cse21)) (.cse4 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0))) (.cse20 (= ~token~0 ~local~0)) (.cse6 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse18 (= ~t2_pc~0 1)) (.cse19 (= ~m_pc~0 1)) (.cse8 (not (= ~E_M~0 0))) (.cse9 (not (= 0 ~t2_st~0))) (.cse17 (not .cse26)) (.cse15 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse22 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse23 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse24 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse5 (not (= ~T2_E~0 1))) (.cse7 (<= 2 ~E_2~0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 1))) (.cse12 (not (= ~E_1~0 0))) (.cse13 (= ~t2_i~0 1)) (.cse25 (= ~m_pc~0 0)) (.cse14 (not (= ~T2_E~0 0))) (.cse16 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse18 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (and .cse21 .cse0 .cse1 .cse2 .cse22 .cse23 .cse24 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse25 .cse17 .cse14 .cse20 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse22 .cse23 .cse3 .cse24 .cse4 .cse5 .cse6 .cse26 .cse7 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse25 .cse14 .cse20 .cse15 .cse16) (and .cse21 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse5 .cse6 .cse7 .cse18 .cse19 .cse8 .cse9 .cse11 .cse12 .cse13 (< (+ ~local~0 1) ~token~0) .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse22 .cse23 .cse24 .cse5 .cse7 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse16)))) [2021-11-23 13:34:15,482 INFO L858 garLoopResultBuilder]: For program point L354-1(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,482 INFO L858 garLoopResultBuilder]: For program point L354-3(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,482 INFO L854 garLoopResultBuilder]: At program point L553-2(lines 553 590) the Hoare annotation is: (let ((.cse11 (= ~t1_st~0 0)) (.cse6 (= 0 ~t2_st~0)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse15 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse16 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse17 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (= |ULTIMATE.start_is_transmit2_triggered_#res#1| 0)) (.cse5 (= |ULTIMATE.start_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse18 (= ~m_pc~0 0)) (.cse12 (not (= ~T2_E~0 0))) (.cse13 (= |ULTIMATE.start_activate_threads_~tmp___1~0#1| 0)) (.cse14 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 0)) .cse5 (not .cse6) .cse7 .cse8 .cse9 .cse10 (not .cse11) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse16 (not (= ~t1_pc~0 1)) .cse17 .cse2 .cse11 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse18 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse6 .cse12 (= ~token~0 ~local~0) .cse13 (= ~M_E~0 2)) (and .cse0 .cse1 .cse15 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse18 .cse12 .cse13 .cse14))) [2021-11-23 13:34:15,482 INFO L858 garLoopResultBuilder]: For program point L554(line 554) no Hoare annotation was computed. [2021-11-23 13:34:15,482 INFO L854 garLoopResultBuilder]: At program point L224(lines 219 226) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-11-23 13:34:15,483 INFO L854 garLoopResultBuilder]: At program point L224-1(lines 219 226) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse3 (<= 2 ~E_2~0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (not (= ~T2_E~0 0))) (.cse9 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~E_M~0 0)) (not (= 0 ~t2_st~0)) .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9))) [2021-11-23 13:34:15,483 INFO L858 garLoopResultBuilder]: For program point L489-1(lines 473 506) no Hoare annotation was computed. [2021-11-23 13:34:15,483 INFO L858 garLoopResultBuilder]: For program point L291(lines 281 333) no Hoare annotation was computed. [2021-11-23 13:34:15,483 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-11-23 13:34:15,483 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-23 13:34:15,483 INFO L858 garLoopResultBuilder]: For program point L425(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,483 INFO L858 garLoopResultBuilder]: For program point L425-2(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,484 INFO L858 garLoopResultBuilder]: For program point L359-1(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,484 INFO L858 garLoopResultBuilder]: For program point L425-3(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,484 INFO L858 garLoopResultBuilder]: For program point L425-5(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,484 INFO L858 garLoopResultBuilder]: For program point L359-3(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,484 INFO L858 garLoopResultBuilder]: For program point L425-6(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,484 INFO L858 garLoopResultBuilder]: For program point L425-8(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,484 INFO L858 garLoopResultBuilder]: For program point L425-9(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,485 INFO L858 garLoopResultBuilder]: For program point L425-11(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,485 INFO L858 garLoopResultBuilder]: For program point L425-12(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,485 INFO L858 garLoopResultBuilder]: For program point L425-14(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,485 INFO L858 garLoopResultBuilder]: For program point L425-15(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,485 INFO L858 garLoopResultBuilder]: For program point L425-17(lines 425 429) no Hoare annotation was computed. [2021-11-23 13:34:15,485 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 301) no Hoare annotation was computed. [2021-11-23 13:34:15,485 INFO L858 garLoopResultBuilder]: For program point L97(lines 97 101) no Hoare annotation was computed. [2021-11-23 13:34:15,486 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 473 506) no Hoare annotation was computed. [2021-11-23 13:34:15,486 INFO L854 garLoopResultBuilder]: At program point L98(lines 93 124) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse10 (not (= ~t1_st~0 0))) (.cse5 (= 0 ~t2_st~0)) (.cse12 (= ~M_E~0 2)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T2_E~0 1))) (.cse4 (<= 2 ~E_2~0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse11 (not (= ~T2_E~0 0))) (.cse13 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~t2_pc~0 1) (= ~m_pc~0 1) (not (= ~E_M~0 0)) (not .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse12 .cse13) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res#1| 0)) .cse1 (not (= |ULTIMATE.start_exists_runnable_thread_~__retres1~3#1| 0)) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_pc~0) (= ~E_M~0 ~M_E~0) .cse10 .cse5 .cse11 .cse12 .cse13) (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse11 .cse13))) [2021-11-23 13:34:15,486 INFO L858 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2021-11-23 13:34:15,486 INFO L858 garLoopResultBuilder]: For program point L231-2(lines 230 248) no Hoare annotation was computed. [2021-11-23 13:34:15,486 INFO L858 garLoopResultBuilder]: For program point L364-1(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,486 INFO L858 garLoopResultBuilder]: For program point L364-3(lines 343 376) no Hoare annotation was computed. [2021-11-23 13:34:15,487 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,487 INFO L858 garLoopResultBuilder]: For program point L166-2(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,487 INFO L858 garLoopResultBuilder]: For program point L166-3(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,487 INFO L858 garLoopResultBuilder]: For program point L166-5(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,487 INFO L858 garLoopResultBuilder]: For program point L166-6(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,487 INFO L858 garLoopResultBuilder]: For program point L166-8(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,487 INFO L858 garLoopResultBuilder]: For program point L166-9(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,488 INFO L858 garLoopResultBuilder]: For program point L166-11(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,488 INFO L858 garLoopResultBuilder]: For program point L166-12(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,488 INFO L858 garLoopResultBuilder]: For program point L166-14(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,488 INFO L858 garLoopResultBuilder]: For program point L166-15(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,488 INFO L858 garLoopResultBuilder]: For program point L166-17(lines 166 175) no Hoare annotation was computed. [2021-11-23 13:34:15,488 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:34:15,488 INFO L858 garLoopResultBuilder]: For program point L167-1(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:34:15,489 INFO L858 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:34:15,489 INFO L858 garLoopResultBuilder]: For program point L167-3(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:34:15,489 INFO L858 garLoopResultBuilder]: For program point L167-4(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:34:15,489 INFO L858 garLoopResultBuilder]: For program point L167-5(lines 167 172) no Hoare annotation was computed. [2021-11-23 13:34:15,493 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-23 13:34:15,494 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 13:34:15,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:34:15 BoogieIcfgContainer [2021-11-23 13:34:15,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 13:34:15,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 13:34:15,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 13:34:15,652 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 13:34:15,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:27" (3/4) ... [2021-11-23 13:34:15,656 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 13:34:15,686 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2021-11-23 13:34:15,688 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-23 13:34:15,689 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-23 13:34:15,690 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 13:34:15,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && M_E == 2) || (((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) [2021-11-23 13:34:15,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && 0 == t2_st) && M_E == 2) || (((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && 0 == t2_st) && token == local) && M_E == 2) [2021-11-23 13:34:15,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && \result == 0) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && 0 == t2_st) && token == local) && M_E == 2) || ((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && \result == 0) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && 0 == t2_st) && M_E == 2) [2021-11-23 13:34:15,722 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && __retres1 == 0) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && M_E == 2) || (((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && __retres1 == 0) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) [2021-11-23 13:34:15,722 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && M_E == 2) || ((((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) [2021-11-23 13:34:15,722 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && tmp___1 == 0) && M_E == 2) || (((((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && tmp___1 == 0) && M_E == 2) [2021-11-23 13:34:15,724 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(T1_E == 0) && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((!(T1_E == 0) && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,724 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || (((((((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(T2_E == 1)) && t1_st == 0) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,725 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(T2_E == 1)) && t1_st == 0) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((!(E_M == 0) && ((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(t1_pc == 1)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)))) && M_E == 2)) || ((((((((t1_pc == 1 && token <= 2 + local) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && local + 1 < token) && !(t1_st == 0)) && (((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)))) && M_E == 2)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1))) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && token == local) && M_E == 2)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,725 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,725 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,725 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && t1_st == 0) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,726 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && token <= local + 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && token <= 2 + local) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && t1_st == 0) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,727 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) [2021-11-23 13:34:15,727 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && token <= 2 + local) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,727 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && token <= 2 + local) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1) [2021-11-23 13:34:15,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,731 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,732 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,732 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,732 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,736 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,736 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,736 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,737 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && token <= local + 1) && \result == 0) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,737 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2)) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) [2021-11-23 13:34:15,737 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,737 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,740 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,740 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) [2021-11-23 13:34:15,740 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,740 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,740 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) [2021-11-23 13:34:15,740 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) [2021-11-23 13:34:15,741 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,741 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,741 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) [2021-11-23 13:34:15,741 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) [2021-11-23 13:34:15,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) [2021-11-23 13:34:15,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) [2021-11-23 13:34:15,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) [2021-11-23 13:34:15,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,744 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) [2021-11-23 13:34:15,744 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,744 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,744 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,744 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) [2021-11-23 13:34:15,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) [2021-11-23 13:34:15,828 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 13:34:15,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 13:34:15,830 INFO L158 Benchmark]: Toolchain (without parser) took 109457.65ms. Allocated memory was 132.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 92.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 466.0MB. Max. memory is 16.1GB. [2021-11-23 13:34:15,830 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 132.1MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:34:15,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.93ms. Allocated memory is still 132.1MB. Free memory was 91.9MB in the beginning and 103.5MB in the end (delta: -11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 13:34:15,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.32ms. Allocated memory is still 132.1MB. Free memory was 103.5MB in the beginning and 100.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:34:15,832 INFO L158 Benchmark]: Boogie Preprocessor took 48.48ms. Allocated memory is still 132.1MB. Free memory was 100.3MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:34:15,834 INFO L158 Benchmark]: RCFGBuilder took 897.62ms. Allocated memory is still 132.1MB. Free memory was 98.2MB in the beginning and 72.1MB in the end (delta: 26.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-23 13:34:15,835 INFO L158 Benchmark]: TraceAbstraction took 107867.11ms. Allocated memory was 132.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 71.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-11-23 13:34:15,835 INFO L158 Benchmark]: Witness Printer took 176.88ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-23 13:34:15,845 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 132.1MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.93ms. Allocated memory is still 132.1MB. Free memory was 91.9MB in the beginning and 103.5MB in the end (delta: -11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.32ms. Allocated memory is still 132.1MB. Free memory was 103.5MB in the beginning and 100.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.48ms. Allocated memory is still 132.1MB. Free memory was 100.3MB in the beginning and 98.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 897.62ms. Allocated memory is still 132.1MB. Free memory was 98.2MB in the beginning and 72.1MB in the end (delta: 26.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 107867.11ms. Allocated memory was 132.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 71.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 176.88ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 232 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 107.6s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 90.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12680 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12680 mSDsluCounter, 18221 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9629 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 810 IncrementalHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 8592 mSDtfsCounter, 810 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9909occurred in iteration=19, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 5282 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 1076 NumberOfFragments, 16268 HoareAnnotationTreeSize, 78 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 57.8s HoareSimplificationTime, 78 FomulaSimplificationsInter, 10363947 FormulaSimplificationTreeSizeReductionInter, 32.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2685 NumberOfCodeBlocks, 2685 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2658 ConstructedInterpolants, 0 QuantifiedInterpolants, 4976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 368/368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && token <= 2 + local) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1) - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || (((((((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(T2_E == 1)) && t1_st == 0) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && \result == 0) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && 0 == t2_st) && token == local) && M_E == 2) || ((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && \result == 0) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && 0 == t2_st) && M_E == 2) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && token <= local + 1) && \result == 0) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 597]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && tmp___1 == 0) && M_E == 2) || (((((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && tmp___1 == 0) && M_E == 2) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(T1_E == 0) && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((!(T1_E == 0) && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && token <= 2 + local) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && M_E == 2) || (((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && t1_st == 0) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && M_E == 2) || ((((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && \result == 0) && T2_E == M_E) && __retres1 == 0) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2)) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && tmp___1 == 0) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && token <= local + 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && token <= 2 + local) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && t1_st == 0) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 538]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && M_E == 2) || (((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && M_E == 2) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= 2 + local) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && local + 1 < token) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2)) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) || (((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1)) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && E_M == M_E) && 0 == t2_st) && M_E == 2) || (((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: (((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && !(E_M == 0)) && __retres1 == 0) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && \result == 0) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && tmp___1 == 0) && !(E_M == 1)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && __retres1 == 0) && 0 == t2_st) && M_E == 2) || (((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && 0 == t2_st) && token == local) && M_E == 2) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && __retres1 == 0) && !(m_st == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && M_E == 2) || (((((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && 2 <= E_2) && T2_E == M_E) && __retres1 == 0) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && token == local) && M_E == 2) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && __retres1 == 0) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && m_pc == 1) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1)) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(t1_st == 0)) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(T2_E == 1)) && t1_st == 0) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((!(E_M == 0) && ((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(t1_pc == 1)) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(t1_pc == 1)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)))) && M_E == 2)) || ((((((((t1_pc == 1 && token <= 2 + local) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && local + 1 < token) && !(t1_st == 0)) && (((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)))) && M_E == 2)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && 2 <= E_2) && !(E_M == 0)) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(t1_pc == 1)) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(E_M == 0)) && !(0 == t2_st)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && !(\result == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && 0 == t2_st) && !(T2_E == 0)) && token == local) && M_E == 2) && !(E_M == 1))) || (((((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1)) || ((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && 2 <= E_2) && !(0 == t2_st)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(T2_E == 0)) && !(E_M == 1))) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && token == local) && M_E == 2)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && \result == 0) && !(T2_E == 1)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 0) && !(T2_E == 0)) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && token <= local + 1) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && !(\result == 0)) && t1_i == 1) && !(__retres1 == 0)) && !(T2_E == 1)) && !(tmp == 0)) && 2 <= E_2) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && E_M == M_E) && !(t1_st == 0)) && !(T2_E == 0)) && M_E == 2) && !(E_M == 1)) RESULT: Ultimate proved your program to be correct! [2021-11-23 13:34:15,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25682af6-a4f4-40a4-81d6-074052fa7db6/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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