./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4996a252ab084c920e1b9a19c3119ce328d4cb97d6d45029062c9dac50449e19 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:03:26,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:03:26,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:03:27,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:03:27,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:03:27,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:03:27,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:03:27,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:03:27,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:03:27,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:03:27,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:03:27,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:03:27,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:03:27,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:03:27,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:03:27,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:03:27,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:03:27,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:03:27,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:03:27,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:03:27,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:03:27,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:03:27,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:03:27,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:03:27,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:03:27,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:03:27,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:03:27,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:03:27,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:03:27,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:03:27,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:03:27,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:03:27,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:03:27,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:03:27,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:03:27,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:03:27,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:03:27,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:03:27,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:03:27,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:03:27,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:03:27,090 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:03:27,122 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:03:27,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:03:27,140 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:03:27,141 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:03:27,141 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:03:27,141 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:03:27,142 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:03:27,142 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:03:27,142 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:03:27,143 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:03:27,143 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:03:27,143 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:03:27,145 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:03:27,146 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:03:27,146 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:03:27,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:03:27,147 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:03:27,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:03:27,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:03:27,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:03:27,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:03:27,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:03:27,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:03:27,150 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:03:27,150 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:03:27,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:03:27,151 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:03:27,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:03:27,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:03:27,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:03:27,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:03:27,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:03:27,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:03:27,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:03:27,153 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:03:27,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:03:27,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:03:27,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:03:27,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:03:27,155 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/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_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8 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 -> Taipan 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 -> 4996a252ab084c920e1b9a19c3119ce328d4cb97d6d45029062c9dac50449e19 [2021-11-07 01:03:27,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:03:27,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:03:27,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:03:27,515 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:03:27,516 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:03:27,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2021-11-07 01:03:27,593 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/data/0719623a6/dae6cf99f33840e7afe0ed87a2bf924a/FLAGc7dc2ee76 [2021-11-07 01:03:28,234 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:03:28,235 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2021-11-07 01:03:28,248 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/data/0719623a6/dae6cf99f33840e7afe0ed87a2bf924a/FLAGc7dc2ee76 [2021-11-07 01:03:28,524 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/data/0719623a6/dae6cf99f33840e7afe0ed87a2bf924a [2021-11-07 01:03:28,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:03:28,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:03:28,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:03:28,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:03:28,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:03:28,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:03:28" (1/1) ... [2021-11-07 01:03:28,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197d18fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:28, skipping insertion in model container [2021-11-07 01:03:28,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:03:28" (1/1) ... [2021-11-07 01:03:28,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:03:28,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:03:28,849 WARN L228 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_0aa43a87-ae8d-4ed3-b518-108adb65412d/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[671,684] [2021-11-07 01:03:28,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:03:28,950 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:03:28,962 WARN L228 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_0aa43a87-ae8d-4ed3-b518-108adb65412d/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[671,684] [2021-11-07 01:03:29,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:03:29,032 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:03:29,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29 WrapperNode [2021-11-07 01:03:29,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:03:29,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:03:29,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:03:29,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:03:29,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:03:29,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:03:29,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:03:29,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:03:29,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:03:29,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:03:29,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:03:29,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:03:29,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2021-11-07 01:03:29,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:03:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:03:29,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:03:29,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:03:29,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:03:29,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:03:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:03:29,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:03:31,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:03:31,750 INFO L299 CfgBuilder]: Removed 130 assume(true) statements. [2021-11-07 01:03:31,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:31 BoogieIcfgContainer [2021-11-07 01:03:31,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:03:31,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:03:31,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:03:31,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:03:31,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:03:28" (1/3) ... [2021-11-07 01:03:31,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5e9654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:03:31, skipping insertion in model container [2021-11-07 01:03:31,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (2/3) ... [2021-11-07 01:03:31,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5e9654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:03:31, skipping insertion in model container [2021-11-07 01:03:31,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:31" (3/3) ... [2021-11-07 01:03:31,768 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2021-11-07 01:03:31,775 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:03:31,775 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:03:31,841 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:03:31,848 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=FINITE_AUTOMATA, 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-07 01:03:31,848 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:03:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 144 states have internal predecessors, (223), 0 states have call successors, (0), 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-07 01:03:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:03:31,881 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:31,882 INFO L513 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] [2021-11-07 01:03:31,882 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:31,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash 572825465, now seen corresponding path program 1 times [2021-11-07 01:03:31,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:31,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181217289] [2021-11-07 01:03:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:31,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:32,133 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-07 01:03:32,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:32,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181217289] [2021-11-07 01:03:32,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181217289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:32,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:32,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:03:32,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658600280] [2021-11-07 01:03:32,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:32,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:32,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:03:32,187 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 144 states have internal predecessors, (223), 0 states have call successors, (0), 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 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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-07 01:03:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:32,371 INFO L93 Difference]: Finished difference Result 405 states and 621 transitions. [2021-11-07 01:03:32,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:32,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-11-07 01:03:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:32,395 INFO L225 Difference]: With dead ends: 405 [2021-11-07 01:03:32,395 INFO L226 Difference]: Without dead ends: 258 [2021-11-07 01:03:32,402 INFO L786 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-07 01:03:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-07 01:03:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 244. [2021-11-07 01:03:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 243 states have internal predecessors, (362), 0 states have call successors, (0), 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-07 01:03:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 362 transitions. [2021-11-07 01:03:32,499 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 362 transitions. Word has length 22 [2021-11-07 01:03:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:32,500 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 362 transitions. [2021-11-07 01:03:32,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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-07 01:03:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 362 transitions. [2021-11-07 01:03:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 01:03:32,506 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:32,506 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 01:03:32,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:03:32,507 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1184571469, now seen corresponding path program 1 times [2021-11-07 01:03:32,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:32,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293606259] [2021-11-07 01:03:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:32,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:03:32,604 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:32,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293606259] [2021-11-07 01:03:32,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293606259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:32,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:32,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:32,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272271209] [2021-11-07 01:03:32,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:32,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:32,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:32,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:32,610 INFO L87 Difference]: Start difference. First operand 244 states and 362 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-07 01:03:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:32,770 INFO L93 Difference]: Finished difference Result 774 states and 1140 transitions. [2021-11-07 01:03:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 43 [2021-11-07 01:03:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:32,777 INFO L225 Difference]: With dead ends: 774 [2021-11-07 01:03:32,778 INFO L226 Difference]: Without dead ends: 539 [2021-11-07 01:03:32,780 INFO L786 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-07 01:03:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-07 01:03:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 427. [2021-11-07 01:03:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.460093896713615) internal successors, (622), 426 states have internal predecessors, (622), 0 states have call successors, (0), 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-07 01:03:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 622 transitions. [2021-11-07 01:03:32,826 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 622 transitions. Word has length 43 [2021-11-07 01:03:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:32,826 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 622 transitions. [2021-11-07 01:03:32,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-07 01:03:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 622 transitions. [2021-11-07 01:03:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 01:03:32,832 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:32,832 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 01:03:32,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:03:32,833 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -580245140, now seen corresponding path program 1 times [2021-11-07 01:03:32,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:32,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392066077] [2021-11-07 01:03:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:32,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:03:32,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:32,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392066077] [2021-11-07 01:03:32,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392066077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:32,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:32,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:32,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164037992] [2021-11-07 01:03:32,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:32,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:32,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:32,923 INFO L87 Difference]: Start difference. First operand 427 states and 622 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-07 01:03:33,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:33,077 INFO L93 Difference]: Finished difference Result 1358 states and 1963 transitions. [2021-11-07 01:03:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:33,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 43 [2021-11-07 01:03:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:33,086 INFO L225 Difference]: With dead ends: 1358 [2021-11-07 01:03:33,086 INFO L226 Difference]: Without dead ends: 943 [2021-11-07 01:03:33,090 INFO L786 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-07 01:03:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-11-07 01:03:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 756. [2021-11-07 01:03:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.4317880794701987) internal successors, (1081), 755 states have internal predecessors, (1081), 0 states have call successors, (0), 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-07 01:03:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1081 transitions. [2021-11-07 01:03:33,160 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1081 transitions. Word has length 43 [2021-11-07 01:03:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:33,161 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1081 transitions. [2021-11-07 01:03:33,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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-07 01:03:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1081 transitions. [2021-11-07 01:03:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 01:03:33,167 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:33,167 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 01:03:33,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:03:33,168 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1133803276, now seen corresponding path program 1 times [2021-11-07 01:03:33,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:33,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103258876] [2021-11-07 01:03:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:33,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:33,253 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:33,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103258876] [2021-11-07 01:03:33,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103258876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:33,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:33,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:33,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112458021] [2021-11-07 01:03:33,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:33,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:33,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:03:33,257 INFO L87 Difference]: Start difference. First operand 756 states and 1081 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-07 01:03:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:33,361 INFO L93 Difference]: Finished difference Result 2176 states and 3095 transitions. [2021-11-07 01:03:33,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-07 01:03:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:33,373 INFO L225 Difference]: With dead ends: 2176 [2021-11-07 01:03:33,373 INFO L226 Difference]: Without dead ends: 1425 [2021-11-07 01:03:33,375 INFO L786 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-07 01:03:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2021-11-07 01:03:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1343. [2021-11-07 01:03:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1342 states have (on average 1.405365126676602) internal successors, (1886), 1342 states have internal predecessors, (1886), 0 states have call successors, (0), 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-07 01:03:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1886 transitions. [2021-11-07 01:03:33,450 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1886 transitions. Word has length 43 [2021-11-07 01:03:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:33,451 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1886 transitions. [2021-11-07 01:03:33,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-07 01:03:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1886 transitions. [2021-11-07 01:03:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 01:03:33,454 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:33,454 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 01:03:33,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:03:33,455 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:33,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1795137067, now seen corresponding path program 1 times [2021-11-07 01:03:33,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:33,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030426694] [2021-11-07 01:03:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:33,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:33,546 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:33,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030426694] [2021-11-07 01:03:33,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030426694] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:33,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:33,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:33,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817774338] [2021-11-07 01:03:33,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:33,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:33,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:33,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:03:33,551 INFO L87 Difference]: Start difference. First operand 1343 states and 1886 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-07 01:03:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:33,693 INFO L93 Difference]: Finished difference Result 2321 states and 3335 transitions. [2021-11-07 01:03:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:33,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-11-07 01:03:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:33,708 INFO L225 Difference]: With dead ends: 2321 [2021-11-07 01:03:33,708 INFO L226 Difference]: Without dead ends: 1563 [2021-11-07 01:03:33,710 INFO L786 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-07 01:03:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2021-11-07 01:03:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1475. [2021-11-07 01:03:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.4314789687924017) internal successors, (2110), 1474 states have internal predecessors, (2110), 0 states have call successors, (0), 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-07 01:03:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2110 transitions. [2021-11-07 01:03:33,793 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2110 transitions. Word has length 43 [2021-11-07 01:03:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:33,796 INFO L470 AbstractCegarLoop]: Abstraction has 1475 states and 2110 transitions. [2021-11-07 01:03:33,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-07 01:03:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2110 transitions. [2021-11-07 01:03:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 01:03:33,803 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:33,804 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:33,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:03:33,805 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:33,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2079457665, now seen corresponding path program 1 times [2021-11-07 01:03:33,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:33,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872830470] [2021-11-07 01:03:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:33,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:33,900 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:33,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872830470] [2021-11-07 01:03:33,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872830470] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:33,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:33,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:33,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526502211] [2021-11-07 01:03:33,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:33,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:33,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:03:33,904 INFO L87 Difference]: Start difference. First operand 1475 states and 2110 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-07 01:03:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:34,030 INFO L93 Difference]: Finished difference Result 2465 states and 3547 transitions. [2021-11-07 01:03:34,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:34,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-11-07 01:03:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:34,043 INFO L225 Difference]: With dead ends: 2465 [2021-11-07 01:03:34,043 INFO L226 Difference]: Without dead ends: 1575 [2021-11-07 01:03:34,045 INFO L786 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-07 01:03:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2021-11-07 01:03:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1475. [2021-11-07 01:03:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.3962008141112618) internal successors, (2058), 1474 states have internal predecessors, (2058), 0 states have call successors, (0), 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-07 01:03:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2058 transitions. [2021-11-07 01:03:34,131 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2058 transitions. Word has length 62 [2021-11-07 01:03:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:34,131 INFO L470 AbstractCegarLoop]: Abstraction has 1475 states and 2058 transitions. [2021-11-07 01:03:34,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-07 01:03:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2058 transitions. [2021-11-07 01:03:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 01:03:34,136 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:34,137 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:34,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:03:34,137 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash -489062688, now seen corresponding path program 1 times [2021-11-07 01:03:34,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:34,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269120174] [2021-11-07 01:03:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:34,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:03:34,287 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:34,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269120174] [2021-11-07 01:03:34,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269120174] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:34,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:34,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:34,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086368709] [2021-11-07 01:03:34,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:34,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:34,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:34,293 INFO L87 Difference]: Start difference. First operand 1475 states and 2058 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-07 01:03:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:34,673 INFO L93 Difference]: Finished difference Result 5057 states and 7089 transitions. [2021-11-07 01:03:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:34,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 62 [2021-11-07 01:03:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:34,707 INFO L225 Difference]: With dead ends: 5057 [2021-11-07 01:03:34,707 INFO L226 Difference]: Without dead ends: 3595 [2021-11-07 01:03:34,714 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2021-11-07 01:03:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 2735. [2021-11-07 01:03:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2734 states have (on average 1.3833211411850768) internal successors, (3782), 2734 states have internal predecessors, (3782), 0 states have call successors, (0), 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-07 01:03:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3782 transitions. [2021-11-07 01:03:34,929 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3782 transitions. Word has length 62 [2021-11-07 01:03:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:34,930 INFO L470 AbstractCegarLoop]: Abstraction has 2735 states and 3782 transitions. [2021-11-07 01:03:34,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-07 01:03:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3782 transitions. [2021-11-07 01:03:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-07 01:03:34,937 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:34,938 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:34,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:03:34,938 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2082914173, now seen corresponding path program 1 times [2021-11-07 01:03:34,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:34,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585769608] [2021-11-07 01:03:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:34,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:03:35,092 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:35,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585769608] [2021-11-07 01:03:35,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585769608] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:35,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:35,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:35,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121686358] [2021-11-07 01:03:35,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:35,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:35,095 INFO L87 Difference]: Start difference. First operand 2735 states and 3782 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-07 01:03:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:35,602 INFO L93 Difference]: Finished difference Result 9475 states and 13123 transitions. [2021-11-07 01:03:35,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:35,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 63 [2021-11-07 01:03:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:35,653 INFO L225 Difference]: With dead ends: 9475 [2021-11-07 01:03:35,653 INFO L226 Difference]: Without dead ends: 6753 [2021-11-07 01:03:35,660 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2021-11-07 01:03:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 5055. [2021-11-07 01:03:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5055 states, 5054 states have (on average 1.367233874159082) internal successors, (6910), 5054 states have internal predecessors, (6910), 0 states have call successors, (0), 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-07 01:03:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6910 transitions. [2021-11-07 01:03:36,070 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6910 transitions. Word has length 63 [2021-11-07 01:03:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:36,071 INFO L470 AbstractCegarLoop]: Abstraction has 5055 states and 6910 transitions. [2021-11-07 01:03:36,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-07 01:03:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6910 transitions. [2021-11-07 01:03:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 01:03:36,084 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:36,084 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:36,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:03:36,085 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:36,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash 350724055, now seen corresponding path program 1 times [2021-11-07 01:03:36,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:36,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172463140] [2021-11-07 01:03:36,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:36,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:36,254 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:36,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172463140] [2021-11-07 01:03:36,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172463140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:36,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:36,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:03:36,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294892528] [2021-11-07 01:03:36,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:36,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:36,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:36,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:36,263 INFO L87 Difference]: Start difference. First operand 5055 states and 6910 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-07 01:03:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:36,758 INFO L93 Difference]: Finished difference Result 10727 states and 14975 transitions. [2021-11-07 01:03:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:03:36,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-11-07 01:03:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:36,809 INFO L225 Difference]: With dead ends: 10727 [2021-11-07 01:03:36,810 INFO L226 Difference]: Without dead ends: 5685 [2021-11-07 01:03:36,822 INFO L786 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-07 01:03:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5685 states. [2021-11-07 01:03:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5685 to 4000. [2021-11-07 01:03:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4000 states, 3999 states have (on average 1.388097024256064) internal successors, (5551), 3999 states have internal predecessors, (5551), 0 states have call successors, (0), 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-07 01:03:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 5551 transitions. [2021-11-07 01:03:37,211 INFO L78 Accepts]: Start accepts. Automaton has 4000 states and 5551 transitions. Word has length 64 [2021-11-07 01:03:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:37,212 INFO L470 AbstractCegarLoop]: Abstraction has 4000 states and 5551 transitions. [2021-11-07 01:03:37,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-07 01:03:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4000 states and 5551 transitions. [2021-11-07 01:03:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-07 01:03:37,227 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:37,227 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:37,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:03:37,227 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash 931338350, now seen corresponding path program 1 times [2021-11-07 01:03:37,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:37,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806830308] [2021-11-07 01:03:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:37,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:37,349 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:37,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806830308] [2021-11-07 01:03:37,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806830308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:37,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:37,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:37,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216809546] [2021-11-07 01:03:37,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:37,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:03:37,353 INFO L87 Difference]: Start difference. First operand 4000 states and 5551 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-07 01:03:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:37,682 INFO L93 Difference]: Finished difference Result 7986 states and 11088 transitions. [2021-11-07 01:03:37,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:37,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-07 01:03:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:37,734 INFO L225 Difference]: With dead ends: 7986 [2021-11-07 01:03:37,734 INFO L226 Difference]: Without dead ends: 4000 [2021-11-07 01:03:37,741 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-07 01:03:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2021-11-07 01:03:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 4000. [2021-11-07 01:03:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4000 states, 3999 states have (on average 1.3700925231307828) internal successors, (5479), 3999 states have internal predecessors, (5479), 0 states have call successors, (0), 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-07 01:03:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 5479 transitions. [2021-11-07 01:03:38,026 INFO L78 Accepts]: Start accepts. Automaton has 4000 states and 5479 transitions. Word has length 66 [2021-11-07 01:03:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:38,028 INFO L470 AbstractCegarLoop]: Abstraction has 4000 states and 5479 transitions. [2021-11-07 01:03:38,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-07 01:03:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4000 states and 5479 transitions. [2021-11-07 01:03:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-07 01:03:38,038 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:38,039 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:38,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:03:38,039 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash -42150609, now seen corresponding path program 1 times [2021-11-07 01:03:38,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:38,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398083371] [2021-11-07 01:03:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:38,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:38,105 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:38,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398083371] [2021-11-07 01:03:38,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398083371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:38,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:38,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:38,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795901569] [2021-11-07 01:03:38,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:38,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:38,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:38,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:03:38,109 INFO L87 Difference]: Start difference. First operand 4000 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-07 01:03:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:38,358 INFO L93 Difference]: Finished difference Result 6804 states and 9356 transitions. [2021-11-07 01:03:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-11-07 01:03:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:38,367 INFO L225 Difference]: With dead ends: 6804 [2021-11-07 01:03:38,368 INFO L226 Difference]: Without dead ends: 2818 [2021-11-07 01:03:38,375 INFO L786 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-07 01:03:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2021-11-07 01:03:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2787. [2021-11-07 01:03:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2786 states have (on average 1.3370423546302943) internal successors, (3725), 2786 states have internal predecessors, (3725), 0 states have call successors, (0), 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-07 01:03:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3725 transitions. [2021-11-07 01:03:38,565 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3725 transitions. Word has length 66 [2021-11-07 01:03:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:38,565 INFO L470 AbstractCegarLoop]: Abstraction has 2787 states and 3725 transitions. [2021-11-07 01:03:38,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-07 01:03:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3725 transitions. [2021-11-07 01:03:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-07 01:03:38,573 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:38,573 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:38,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:03:38,574 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1621251242, now seen corresponding path program 1 times [2021-11-07 01:03:38,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:38,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284063884] [2021-11-07 01:03:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:38,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:38,718 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:38,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284063884] [2021-11-07 01:03:38,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284063884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:38,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:38,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 01:03:38,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440418874] [2021-11-07 01:03:38,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 01:03:38,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 01:03:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:03:38,734 INFO L87 Difference]: Start difference. First operand 2787 states and 3725 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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-07 01:03:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:39,205 INFO L93 Difference]: Finished difference Result 4531 states and 6088 transitions. [2021-11-07 01:03:39,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:03:39,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-11-07 01:03:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:39,215 INFO L225 Difference]: With dead ends: 4531 [2021-11-07 01:03:39,215 INFO L226 Difference]: Without dead ends: 3223 [2021-11-07 01:03:39,219 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:03:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2021-11-07 01:03:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2861. [2021-11-07 01:03:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 1.3388111888111889) internal successors, (3829), 2860 states have internal predecessors, (3829), 0 states have call successors, (0), 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-07 01:03:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3829 transitions. [2021-11-07 01:03:39,410 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3829 transitions. Word has length 67 [2021-11-07 01:03:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:39,410 INFO L470 AbstractCegarLoop]: Abstraction has 2861 states and 3829 transitions. [2021-11-07 01:03:39,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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-07 01:03:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3829 transitions. [2021-11-07 01:03:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 01:03:39,418 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:39,418 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:39,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:03:39,419 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:39,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1037569389, now seen corresponding path program 1 times [2021-11-07 01:03:39,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:39,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972458729] [2021-11-07 01:03:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:39,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:03:39,548 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:39,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972458729] [2021-11-07 01:03:39,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972458729] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:39,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:39,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:03:39,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123227722] [2021-11-07 01:03:39,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:03:39,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:39,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:03:39,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:03:39,562 INFO L87 Difference]: Start difference. First operand 2861 states and 3829 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 01:03:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:39,845 INFO L93 Difference]: Finished difference Result 4811 states and 6467 transitions. [2021-11-07 01:03:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 69 [2021-11-07 01:03:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:39,855 INFO L225 Difference]: With dead ends: 4811 [2021-11-07 01:03:39,855 INFO L226 Difference]: Without dead ends: 3007 [2021-11-07 01:03:39,859 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:03:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2021-11-07 01:03:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2861. [2021-11-07 01:03:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 1.3206293706293706) internal successors, (3777), 2860 states have internal predecessors, (3777), 0 states have call successors, (0), 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-07 01:03:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3777 transitions. [2021-11-07 01:03:40,120 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3777 transitions. Word has length 69 [2021-11-07 01:03:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:40,120 INFO L470 AbstractCegarLoop]: Abstraction has 2861 states and 3777 transitions. [2021-11-07 01:03:40,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-07 01:03:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3777 transitions. [2021-11-07 01:03:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 01:03:40,134 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:40,134 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:40,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:03:40,135 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash -981204814, now seen corresponding path program 1 times [2021-11-07 01:03:40,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:40,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367078166] [2021-11-07 01:03:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:40,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:40,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:40,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367078166] [2021-11-07 01:03:40,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367078166] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:03:40,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859322533] [2021-11-07 01:03:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:40,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:03:40,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:03:40,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:03:40,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:03:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:40,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 01:03:40,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:03:40,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 01:03:41,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859322533] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:41,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:03:41,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 7 [2021-11-07 01:03:41,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059848411] [2021-11-07 01:03:41,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:41,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:41,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:03:41,197 INFO L87 Difference]: Start difference. First operand 2861 states and 3777 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 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-07 01:03:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:41,617 INFO L93 Difference]: Finished difference Result 7910 states and 10373 transitions. [2021-11-07 01:03:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 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 70 [2021-11-07 01:03:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:41,630 INFO L225 Difference]: With dead ends: 7910 [2021-11-07 01:03:41,631 INFO L226 Difference]: Without dead ends: 5063 [2021-11-07 01:03:41,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:03:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5063 states. [2021-11-07 01:03:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5063 to 5061. [2021-11-07 01:03:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5061 states, 5060 states have (on average 1.290909090909091) internal successors, (6532), 5060 states have internal predecessors, (6532), 0 states have call successors, (0), 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-07 01:03:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5061 states to 5061 states and 6532 transitions. [2021-11-07 01:03:41,990 INFO L78 Accepts]: Start accepts. Automaton has 5061 states and 6532 transitions. Word has length 70 [2021-11-07 01:03:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:41,990 INFO L470 AbstractCegarLoop]: Abstraction has 5061 states and 6532 transitions. [2021-11-07 01:03:41,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 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-07 01:03:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 5061 states and 6532 transitions. [2021-11-07 01:03:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-07 01:03:42,004 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:42,004 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:42,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:03:42,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-07 01:03:42,228 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:42,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1423923719, now seen corresponding path program 1 times [2021-11-07 01:03:42,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:42,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734188360] [2021-11-07 01:03:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:42,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:42,407 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:42,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734188360] [2021-11-07 01:03:42,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734188360] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:42,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:42,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 01:03:42,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221442700] [2021-11-07 01:03:42,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 01:03:42,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 01:03:42,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:03:42,416 INFO L87 Difference]: Start difference. First operand 5061 states and 6532 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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-07 01:03:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:43,171 INFO L93 Difference]: Finished difference Result 7912 states and 10108 transitions. [2021-11-07 01:03:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 01:03:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-11-07 01:03:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:43,184 INFO L225 Difference]: With dead ends: 7912 [2021-11-07 01:03:43,185 INFO L226 Difference]: Without dead ends: 5488 [2021-11-07 01:03:43,193 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:03:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2021-11-07 01:03:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5092. [2021-11-07 01:03:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5092 states, 5091 states have (on average 1.2909055195442938) internal successors, (6572), 5091 states have internal predecessors, (6572), 0 states have call successors, (0), 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-07 01:03:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5092 states to 5092 states and 6572 transitions. [2021-11-07 01:03:43,554 INFO L78 Accepts]: Start accepts. Automaton has 5092 states and 6572 transitions. Word has length 71 [2021-11-07 01:03:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:43,555 INFO L470 AbstractCegarLoop]: Abstraction has 5092 states and 6572 transitions. [2021-11-07 01:03:43,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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-07 01:03:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5092 states and 6572 transitions. [2021-11-07 01:03:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 01:03:43,568 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:43,568 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 01:03:43,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:03:43,569 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 269841475, now seen corresponding path program 1 times [2021-11-07 01:03:43,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:43,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053617812] [2021-11-07 01:03:43,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:43,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:43,626 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:43,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053617812] [2021-11-07 01:03:43,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053617812] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:03:43,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297145420] [2021-11-07 01:03:43,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:43,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:03:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:03:43,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:03:43,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:03:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:43,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:03:43,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:44,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:44,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297145420] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:44,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:03:44,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 01:03:44,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252553397] [2021-11-07 01:03:44,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:44,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:03:44,293 INFO L87 Difference]: Start difference. First operand 5092 states and 6572 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:03:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:44,745 INFO L93 Difference]: Finished difference Result 11071 states and 14300 transitions. [2021-11-07 01:03:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 72 [2021-11-07 01:03:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:44,763 INFO L225 Difference]: With dead ends: 11071 [2021-11-07 01:03:44,763 INFO L226 Difference]: Without dead ends: 6018 [2021-11-07 01:03:44,772 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:03:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2021-11-07 01:03:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 5344. [2021-11-07 01:03:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5343 states have (on average 1.299457233763803) internal successors, (6943), 5343 states have internal predecessors, (6943), 0 states have call successors, (0), 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-07 01:03:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 6943 transitions. [2021-11-07 01:03:45,121 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 6943 transitions. Word has length 72 [2021-11-07 01:03:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:45,121 INFO L470 AbstractCegarLoop]: Abstraction has 5344 states and 6943 transitions. [2021-11-07 01:03:45,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:03:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 6943 transitions. [2021-11-07 01:03:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 01:03:45,133 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:45,134 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 01:03:45,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:03:45,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-07 01:03:45,350 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1491326152, now seen corresponding path program 1 times [2021-11-07 01:03:45,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:45,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892369993] [2021-11-07 01:03:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:45,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 01:03:45,442 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:45,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892369993] [2021-11-07 01:03:45,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892369993] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:45,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:45,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:45,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413077534] [2021-11-07 01:03:45,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:45,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:45,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:45,446 INFO L87 Difference]: Start difference. First operand 5344 states and 6943 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-07 01:03:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:46,088 INFO L93 Difference]: Finished difference Result 13188 states and 17266 transitions. [2021-11-07 01:03:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:46,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 72 [2021-11-07 01:03:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:46,112 INFO L225 Difference]: With dead ends: 13188 [2021-11-07 01:03:46,112 INFO L226 Difference]: Without dead ends: 7858 [2021-11-07 01:03:46,123 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7858 states. [2021-11-07 01:03:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7858 to 7077. [2021-11-07 01:03:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7077 states, 7076 states have (on average 1.2809496890898813) internal successors, (9064), 7076 states have internal predecessors, (9064), 0 states have call successors, (0), 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-07 01:03:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 9064 transitions. [2021-11-07 01:03:46,626 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 9064 transitions. Word has length 72 [2021-11-07 01:03:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:46,626 INFO L470 AbstractCegarLoop]: Abstraction has 7077 states and 9064 transitions. [2021-11-07 01:03:46,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-07 01:03:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 9064 transitions. [2021-11-07 01:03:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-07 01:03:46,638 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:46,638 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 01:03:46,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 01:03:46,639 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:46,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:46,640 INFO L85 PathProgramCache]: Analyzing trace with hash 590009219, now seen corresponding path program 1 times [2021-11-07 01:03:46,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:46,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837112777] [2021-11-07 01:03:46,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:46,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:46,696 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:46,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837112777] [2021-11-07 01:03:46,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837112777] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:03:46,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090180473] [2021-11-07 01:03:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:46,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:03:46,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:03:46,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:03:46,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:03:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:46,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 01:03:46,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:47,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:47,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090180473] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:47,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:03:47,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 01:03:47,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401798361] [2021-11-07 01:03:47,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:47,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:47,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:47,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:03:47,428 INFO L87 Difference]: Start difference. First operand 7077 states and 9064 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-07 01:03:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:47,822 INFO L93 Difference]: Finished difference Result 14763 states and 18884 transitions. [2021-11-07 01:03:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 73 [2021-11-07 01:03:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:47,844 INFO L225 Difference]: With dead ends: 14763 [2021-11-07 01:03:47,844 INFO L226 Difference]: Without dead ends: 7725 [2021-11-07 01:03:47,856 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:03:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2021-11-07 01:03:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7052. [2021-11-07 01:03:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7052 states, 7051 states have (on average 1.281236704013615) internal successors, (9034), 7051 states have internal predecessors, (9034), 0 states have call successors, (0), 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-07 01:03:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7052 states to 7052 states and 9034 transitions. [2021-11-07 01:03:48,326 INFO L78 Accepts]: Start accepts. Automaton has 7052 states and 9034 transitions. Word has length 73 [2021-11-07 01:03:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:48,326 INFO L470 AbstractCegarLoop]: Abstraction has 7052 states and 9034 transitions. [2021-11-07 01:03:48,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-07 01:03:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 7052 states and 9034 transitions. [2021-11-07 01:03:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-07 01:03:48,339 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:48,339 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:48,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-07 01:03:48,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-07 01:03:48,564 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:48,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 630806110, now seen corresponding path program 1 times [2021-11-07 01:03:48,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:48,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186587043] [2021-11-07 01:03:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:48,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:48,627 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:48,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186587043] [2021-11-07 01:03:48,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186587043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:48,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:48,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:48,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264246514] [2021-11-07 01:03:48,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:48,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:03:48,631 INFO L87 Difference]: Start difference. First operand 7052 states and 9034 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-07 01:03:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:48,974 INFO L93 Difference]: Finished difference Result 12674 states and 16303 transitions. [2021-11-07 01:03:48,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-11-07 01:03:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:48,990 INFO L225 Difference]: With dead ends: 12674 [2021-11-07 01:03:48,990 INFO L226 Difference]: Without dead ends: 5718 [2021-11-07 01:03:49,002 INFO L786 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-07 01:03:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2021-11-07 01:03:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 5646. [2021-11-07 01:03:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5646 states, 5645 states have (on average 1.2526129317980514) internal successors, (7071), 5645 states have internal predecessors, (7071), 0 states have call successors, (0), 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-07 01:03:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 7071 transitions. [2021-11-07 01:03:49,439 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 7071 transitions. Word has length 73 [2021-11-07 01:03:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:49,440 INFO L470 AbstractCegarLoop]: Abstraction has 5646 states and 7071 transitions. [2021-11-07 01:03:49,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-07 01:03:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 7071 transitions. [2021-11-07 01:03:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-07 01:03:49,450 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:49,450 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 01:03:49,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 01:03:49,451 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:49,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1701229789, now seen corresponding path program 1 times [2021-11-07 01:03:49,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:49,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019394863] [2021-11-07 01:03:49,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:49,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:49,551 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:49,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019394863] [2021-11-07 01:03:49,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019394863] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:03:49,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124609434] [2021-11-07 01:03:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:49,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:03:49,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:03:49,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:03:49,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 01:03:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:49,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-07 01:03:49,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:50,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:50,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124609434] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-07 01:03:50,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-07 01:03:50,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 6] total 14 [2021-11-07 01:03:50,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076309514] [2021-11-07 01:03:50,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:03:50,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:50,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:03:50,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:03:50,853 INFO L87 Difference]: Start difference. First operand 5646 states and 7071 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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-07 01:03:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:51,337 INFO L93 Difference]: Finished difference Result 10474 states and 13186 transitions. [2021-11-07 01:03:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:03:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-11-07 01:03:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:51,352 INFO L225 Difference]: With dead ends: 10474 [2021-11-07 01:03:51,352 INFO L226 Difference]: Without dead ends: 5905 [2021-11-07 01:03:51,359 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:03:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5905 states. [2021-11-07 01:03:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5905 to 5195. [2021-11-07 01:03:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5195 states, 5194 states have (on average 1.228725452445129) internal successors, (6382), 5194 states have internal predecessors, (6382), 0 states have call successors, (0), 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-07 01:03:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 6382 transitions. [2021-11-07 01:03:51,810 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 6382 transitions. Word has length 73 [2021-11-07 01:03:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:51,810 INFO L470 AbstractCegarLoop]: Abstraction has 5195 states and 6382 transitions. [2021-11-07 01:03:51,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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-07 01:03:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 6382 transitions. [2021-11-07 01:03:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-07 01:03:51,822 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:51,822 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 01:03:51,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:03:52,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-07 01:03:52,036 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2068385348, now seen corresponding path program 1 times [2021-11-07 01:03:52,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:52,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785192594] [2021-11-07 01:03:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:52,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:03:52,126 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:52,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785192594] [2021-11-07 01:03:52,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785192594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:52,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:52,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:52,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097817460] [2021-11-07 01:03:52,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:52,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:52,131 INFO L87 Difference]: Start difference. First operand 5195 states and 6382 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 01:03:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:52,670 INFO L93 Difference]: Finished difference Result 10054 states and 12401 transitions. [2021-11-07 01:03:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 73 [2021-11-07 01:03:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:52,682 INFO L225 Difference]: With dead ends: 10054 [2021-11-07 01:03:52,682 INFO L226 Difference]: Without dead ends: 6042 [2021-11-07 01:03:52,694 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2021-11-07 01:03:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 5195. [2021-11-07 01:03:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5195 states, 5194 states have (on average 1.2063919907585676) internal successors, (6266), 5194 states have internal predecessors, (6266), 0 states have call successors, (0), 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-07 01:03:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 6266 transitions. [2021-11-07 01:03:53,071 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 6266 transitions. Word has length 73 [2021-11-07 01:03:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:53,071 INFO L470 AbstractCegarLoop]: Abstraction has 5195 states and 6266 transitions. [2021-11-07 01:03:53,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-07 01:03:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 6266 transitions. [2021-11-07 01:03:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 01:03:53,081 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:53,081 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 01:03:53,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 01:03:53,081 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1040624540, now seen corresponding path program 1 times [2021-11-07 01:03:53,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:53,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508514904] [2021-11-07 01:03:53,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:53,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:53,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:53,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508514904] [2021-11-07 01:03:53,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508514904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:53,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:53,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:03:53,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237654926] [2021-11-07 01:03:53,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:53,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:53,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:53,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:53,208 INFO L87 Difference]: Start difference. First operand 5195 states and 6266 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-07 01:03:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:53,748 INFO L93 Difference]: Finished difference Result 11311 states and 13560 transitions. [2021-11-07 01:03:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:53,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-11-07 01:03:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:53,764 INFO L225 Difference]: With dead ends: 11311 [2021-11-07 01:03:53,764 INFO L226 Difference]: Without dead ends: 7299 [2021-11-07 01:03:53,772 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7299 states. [2021-11-07 01:03:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7299 to 6279. [2021-11-07 01:03:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6279 states, 6278 states have (on average 1.189232239566741) internal successors, (7466), 6278 states have internal predecessors, (7466), 0 states have call successors, (0), 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-07 01:03:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 7466 transitions. [2021-11-07 01:03:54,210 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 7466 transitions. Word has length 75 [2021-11-07 01:03:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:54,211 INFO L470 AbstractCegarLoop]: Abstraction has 6279 states and 7466 transitions. [2021-11-07 01:03:54,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-07 01:03:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 7466 transitions. [2021-11-07 01:03:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-07 01:03:54,223 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:54,223 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 01:03:54,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 01:03:54,223 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:54,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2054129221, now seen corresponding path program 1 times [2021-11-07 01:03:54,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:54,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741912076] [2021-11-07 01:03:54,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:54,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:03:54,298 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:54,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741912076] [2021-11-07 01:03:54,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741912076] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:03:54,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208876581] [2021-11-07 01:03:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:54,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:03:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:03:54,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:03:54,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 01:03:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:54,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 01:03:54,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:03:54,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:03:55,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208876581] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:55,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:03:55,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 5 [2021-11-07 01:03:55,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701818257] [2021-11-07 01:03:55,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:55,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:55,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:03:55,250 INFO L87 Difference]: Start difference. First operand 6279 states and 7466 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-07 01:03:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:55,653 INFO L93 Difference]: Finished difference Result 12502 states and 14835 transitions. [2021-11-07 01:03:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:55,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 93 [2021-11-07 01:03:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:55,664 INFO L225 Difference]: With dead ends: 12502 [2021-11-07 01:03:55,665 INFO L226 Difference]: Without dead ends: 6385 [2021-11-07 01:03:55,672 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:03:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6385 states. [2021-11-07 01:03:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6385 to 6279. [2021-11-07 01:03:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6279 states, 6278 states have (on average 1.169958585536795) internal successors, (7345), 6278 states have internal predecessors, (7345), 0 states have call successors, (0), 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-07 01:03:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 7345 transitions. [2021-11-07 01:03:56,148 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 7345 transitions. Word has length 93 [2021-11-07 01:03:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:56,149 INFO L470 AbstractCegarLoop]: Abstraction has 6279 states and 7345 transitions. [2021-11-07 01:03:56,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-07 01:03:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 7345 transitions. [2021-11-07 01:03:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-07 01:03:56,156 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:56,157 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 01:03:56,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-07 01:03:56,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-07 01:03:56,384 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 267957967, now seen corresponding path program 1 times [2021-11-07 01:03:56,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:56,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674067570] [2021-11-07 01:03:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:56,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:56,432 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:56,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674067570] [2021-11-07 01:03:56,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674067570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:56,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:56,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:03:56,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36129289] [2021-11-07 01:03:56,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:03:56,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:56,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:03:56,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:03:56,435 INFO L87 Difference]: Start difference. First operand 6279 states and 7345 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 01:03:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:56,733 INFO L93 Difference]: Finished difference Result 10982 states and 12865 transitions. [2021-11-07 01:03:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:03:56,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2021-11-07 01:03:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:56,739 INFO L225 Difference]: With dead ends: 10982 [2021-11-07 01:03:56,739 INFO L226 Difference]: Without dead ends: 4873 [2021-11-07 01:03:56,743 INFO L786 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-07 01:03:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2021-11-07 01:03:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4839. [2021-11-07 01:03:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4838 states have (on average 1.135386523356759) internal successors, (5493), 4838 states have internal predecessors, (5493), 0 states have call successors, (0), 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-07 01:03:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 5493 transitions. [2021-11-07 01:03:57,170 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 5493 transitions. Word has length 94 [2021-11-07 01:03:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:57,170 INFO L470 AbstractCegarLoop]: Abstraction has 4839 states and 5493 transitions. [2021-11-07 01:03:57,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 01:03:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 5493 transitions. [2021-11-07 01:03:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-07 01:03:57,177 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:57,177 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 01:03:57,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 01:03:57,178 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1851843838, now seen corresponding path program 1 times [2021-11-07 01:03:57,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:57,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069728697] [2021-11-07 01:03:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:57,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:03:57,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:57,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069728697] [2021-11-07 01:03:57,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069728697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:57,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:03:57,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:03:57,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318994488] [2021-11-07 01:03:57,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:03:57,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:57,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:03:57,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:57,248 INFO L87 Difference]: Start difference. First operand 4839 states and 5493 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-07 01:03:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:57,657 INFO L93 Difference]: Finished difference Result 9327 states and 10487 transitions. [2021-11-07 01:03:57,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:03:57,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-11-07 01:03:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:57,666 INFO L225 Difference]: With dead ends: 9327 [2021-11-07 01:03:57,666 INFO L226 Difference]: Without dead ends: 5903 [2021-11-07 01:03:57,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:03:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2021-11-07 01:03:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 5300. [2021-11-07 01:03:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5300 states, 5299 states have (on average 1.1136063408190224) internal successors, (5901), 5299 states have internal predecessors, (5901), 0 states have call successors, (0), 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-07 01:03:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 5901 transitions. [2021-11-07 01:03:57,979 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 5901 transitions. Word has length 96 [2021-11-07 01:03:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:03:57,980 INFO L470 AbstractCegarLoop]: Abstraction has 5300 states and 5901 transitions. [2021-11-07 01:03:57,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-07 01:03:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 5901 transitions. [2021-11-07 01:03:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-07 01:03:57,986 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:03:57,986 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 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-07 01:03:57,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 01:03:57,987 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:03:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:03:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash 930832408, now seen corresponding path program 1 times [2021-11-07 01:03:57,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:03:57,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642017859] [2021-11-07 01:03:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:57,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:03:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 01:03:58,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:03:58,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642017859] [2021-11-07 01:03:58,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642017859] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:03:58,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161484100] [2021-11-07 01:03:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:03:58,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:03:58,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:03:58,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:03:58,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 01:03:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:03:58,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 01:03:58,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:03:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-07 01:03:58,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:03:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-07 01:03:59,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161484100] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:03:59,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:03:59,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2021-11-07 01:03:59,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862435788] [2021-11-07 01:03:59,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:03:59,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:03:59,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:03:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:03:59,132 INFO L87 Difference]: Start difference. First operand 5300 states and 5901 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 01:03:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:03:59,668 INFO L93 Difference]: Finished difference Result 9083 states and 10115 transitions. [2021-11-07 01:03:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:03:59,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 97 [2021-11-07 01:03:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:03:59,676 INFO L225 Difference]: With dead ends: 9083 [2021-11-07 01:03:59,676 INFO L226 Difference]: Without dead ends: 5618 [2021-11-07 01:03:59,680 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:03:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2021-11-07 01:04:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 4980. [2021-11-07 01:04:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4980 states, 4979 states have (on average 1.118497690299257) internal successors, (5569), 4979 states have internal predecessors, (5569), 0 states have call successors, (0), 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-07 01:04:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4980 states to 4980 states and 5569 transitions. [2021-11-07 01:04:00,054 INFO L78 Accepts]: Start accepts. Automaton has 4980 states and 5569 transitions. Word has length 97 [2021-11-07 01:04:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:00,054 INFO L470 AbstractCegarLoop]: Abstraction has 4980 states and 5569 transitions. [2021-11-07 01:04:00,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 01:04:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4980 states and 5569 transitions. [2021-11-07 01:04:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-07 01:04:00,058 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:00,058 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 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-07 01:04:00,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:00,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:04:00,280 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 62132769, now seen corresponding path program 1 times [2021-11-07 01:04:00,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:00,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549253473] [2021-11-07 01:04:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:00,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 01:04:00,356 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:00,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549253473] [2021-11-07 01:04:00,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549253473] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:04:00,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291301920] [2021-11-07 01:04:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:00,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:04:00,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:04:00,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:04:00,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 01:04:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:00,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 01:04:00,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:04:01,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:04:01,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291301920] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:01,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:04:01,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [4] total 7 [2021-11-07 01:04:01,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692335803] [2021-11-07 01:04:01,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:04:01,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:01,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:04:01,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:04:01,358 INFO L87 Difference]: Start difference. First operand 4980 states and 5569 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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-07 01:04:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:01,854 INFO L93 Difference]: Finished difference Result 10362 states and 11644 transitions. [2021-11-07 01:04:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:04:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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 98 [2021-11-07 01:04:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:01,859 INFO L225 Difference]: With dead ends: 10362 [2021-11-07 01:04:01,860 INFO L226 Difference]: Without dead ends: 5508 [2021-11-07 01:04:01,863 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:04:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5508 states. [2021-11-07 01:04:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5508 to 3860. [2021-11-07 01:04:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3860 states, 3859 states have (on average 1.1212749416947396) internal successors, (4327), 3859 states have internal predecessors, (4327), 0 states have call successors, (0), 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-07 01:04:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 4327 transitions. [2021-11-07 01:04:02,105 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 4327 transitions. Word has length 98 [2021-11-07 01:04:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:02,105 INFO L470 AbstractCegarLoop]: Abstraction has 3860 states and 4327 transitions. [2021-11-07 01:04:02,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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-07 01:04:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 4327 transitions. [2021-11-07 01:04:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-07 01:04:02,108 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:02,108 INFO L513 BasicCegarLoop]: trace histogram [4, 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] [2021-11-07 01:04:02,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-07 01:04:02,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-07 01:04:02,336 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:02,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:02,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1533122137, now seen corresponding path program 1 times [2021-11-07 01:04:02,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:02,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118586399] [2021-11-07 01:04:02,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:02,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 01:04:02,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:02,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118586399] [2021-11-07 01:04:02,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118586399] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:04:02,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483540495] [2021-11-07 01:04:02,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:02,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:04:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:04:02,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:04:02,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 01:04:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:02,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:04:02,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:04:03,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:04:04,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483540495] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:04,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:04:04,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [4] total 9 [2021-11-07 01:04:04,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691460832] [2021-11-07 01:04:04,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 01:04:04,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 01:04:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:04:04,550 INFO L87 Difference]: Start difference. First operand 3860 states and 4327 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 8 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-07 01:04:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:05,101 INFO L93 Difference]: Finished difference Result 6653 states and 7435 transitions. [2021-11-07 01:04:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:04:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 8 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 99 [2021-11-07 01:04:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:05,107 INFO L225 Difference]: With dead ends: 6653 [2021-11-07 01:04:05,107 INFO L226 Difference]: Without dead ends: 4180 [2021-11-07 01:04:05,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:04:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2021-11-07 01:04:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 3260. [2021-11-07 01:04:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 3259 states have (on average 1.1162933415158023) internal successors, (3638), 3259 states have internal predecessors, (3638), 0 states have call successors, (0), 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-07 01:04:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 3638 transitions. [2021-11-07 01:04:05,320 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 3638 transitions. Word has length 99 [2021-11-07 01:04:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:05,320 INFO L470 AbstractCegarLoop]: Abstraction has 3260 states and 3638 transitions. [2021-11-07 01:04:05,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 8 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-07 01:04:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 3638 transitions. [2021-11-07 01:04:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-07 01:04:05,323 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:05,323 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 01:04:05,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:05,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-07 01:04:05,524 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1552834506, now seen corresponding path program 1 times [2021-11-07 01:04:05,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:05,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550376242] [2021-11-07 01:04:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:05,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:04:05,689 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:05,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550376242] [2021-11-07 01:04:05,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550376242] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:05,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:05,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:04:05,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317635651] [2021-11-07 01:04:05,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:04:05,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:04:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:04:05,691 INFO L87 Difference]: Start difference. First operand 3260 states and 3638 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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-07 01:04:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:06,688 INFO L93 Difference]: Finished difference Result 11432 states and 12810 transitions. [2021-11-07 01:04:06,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:04:06,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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 118 [2021-11-07 01:04:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:06,699 INFO L225 Difference]: With dead ends: 11432 [2021-11-07 01:04:06,699 INFO L226 Difference]: Without dead ends: 9645 [2021-11-07 01:04:06,703 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:04:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9645 states. [2021-11-07 01:04:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9645 to 5868. [2021-11-07 01:04:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5868 states, 5867 states have (on average 1.1206749616499063) internal successors, (6575), 5867 states have internal predecessors, (6575), 0 states have call successors, (0), 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-07 01:04:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5868 states to 5868 states and 6575 transitions. [2021-11-07 01:04:07,124 INFO L78 Accepts]: Start accepts. Automaton has 5868 states and 6575 transitions. Word has length 118 [2021-11-07 01:04:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:07,125 INFO L470 AbstractCegarLoop]: Abstraction has 5868 states and 6575 transitions. [2021-11-07 01:04:07,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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-07 01:04:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5868 states and 6575 transitions. [2021-11-07 01:04:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-07 01:04:07,129 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:07,129 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-11-07 01:04:07,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 01:04:07,130 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:07,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -527885519, now seen corresponding path program 1 times [2021-11-07 01:04:07,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:07,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934158629] [2021-11-07 01:04:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:07,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 01:04:07,178 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:07,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934158629] [2021-11-07 01:04:07,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934158629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:07,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:07,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:04:07,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906852299] [2021-11-07 01:04:07,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:04:07,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:04:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:04:07,181 INFO L87 Difference]: Start difference. First operand 5868 states and 6575 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:07,760 INFO L93 Difference]: Finished difference Result 11286 states and 12659 transitions. [2021-11-07 01:04:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:04:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-11-07 01:04:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:07,768 INFO L225 Difference]: With dead ends: 11286 [2021-11-07 01:04:07,768 INFO L226 Difference]: Without dead ends: 5732 [2021-11-07 01:04:07,773 INFO L786 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-07 01:04:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2021-11-07 01:04:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 5171. [2021-11-07 01:04:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 5170 states have (on average 1.1251450676982593) internal successors, (5817), 5170 states have internal predecessors, (5817), 0 states have call successors, (0), 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-07 01:04:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 5817 transitions. [2021-11-07 01:04:08,221 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 5817 transitions. Word has length 124 [2021-11-07 01:04:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:08,222 INFO L470 AbstractCegarLoop]: Abstraction has 5171 states and 5817 transitions. [2021-11-07 01:04:08,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:04:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 5817 transitions. [2021-11-07 01:04:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-07 01:04:08,226 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:08,226 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-07 01:04:08,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 01:04:08,227 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash 715697187, now seen corresponding path program 1 times [2021-11-07 01:04:08,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:08,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837776271] [2021-11-07 01:04:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:08,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-07 01:04:08,292 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:08,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837776271] [2021-11-07 01:04:08,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837776271] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:08,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:08,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:04:08,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100337220] [2021-11-07 01:04:08,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:04:08,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:08,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:04:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:04:08,295 INFO L87 Difference]: Start difference. First operand 5171 states and 5817 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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-07 01:04:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:08,779 INFO L93 Difference]: Finished difference Result 8588 states and 9618 transitions. [2021-11-07 01:04:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:04:08,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 143 [2021-11-07 01:04:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:08,785 INFO L225 Difference]: With dead ends: 8588 [2021-11-07 01:04:08,785 INFO L226 Difference]: Without dead ends: 4449 [2021-11-07 01:04:08,789 INFO L786 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-07 01:04:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4449 states. [2021-11-07 01:04:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4449 to 4153. [2021-11-07 01:04:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4153 states, 4152 states have (on average 1.119942196531792) internal successors, (4650), 4152 states have internal predecessors, (4650), 0 states have call successors, (0), 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-07 01:04:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 4650 transitions. [2021-11-07 01:04:09,095 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 4650 transitions. Word has length 143 [2021-11-07 01:04:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:09,096 INFO L470 AbstractCegarLoop]: Abstraction has 4153 states and 4650 transitions. [2021-11-07 01:04:09,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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-07 01:04:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 4650 transitions. [2021-11-07 01:04:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-07 01:04:09,099 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:09,099 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-07 01:04:09,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 01:04:09,099 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2095011768, now seen corresponding path program 1 times [2021-11-07 01:04:09,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:09,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162340381] [2021-11-07 01:04:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:09,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-07 01:04:09,179 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:09,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162340381] [2021-11-07 01:04:09,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162340381] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:09,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:04:09,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:04:09,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630537494] [2021-11-07 01:04:09,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:04:09,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:09,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:04:09,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:04:09,182 INFO L87 Difference]: Start difference. First operand 4153 states and 4650 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 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-07 01:04:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:09,716 INFO L93 Difference]: Finished difference Result 7018 states and 7815 transitions. [2021-11-07 01:04:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:04:09,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 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-07 01:04:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:09,721 INFO L225 Difference]: With dead ends: 7018 [2021-11-07 01:04:09,722 INFO L226 Difference]: Without dead ends: 3494 [2021-11-07 01:04:09,725 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:04:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-11-07 01:04:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3101. [2021-11-07 01:04:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 3100 states have (on average 1.115483870967742) internal successors, (3458), 3100 states have internal predecessors, (3458), 0 states have call successors, (0), 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-07 01:04:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 3458 transitions. [2021-11-07 01:04:10,033 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 3458 transitions. Word has length 144 [2021-11-07 01:04:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:10,034 INFO L470 AbstractCegarLoop]: Abstraction has 3101 states and 3458 transitions. [2021-11-07 01:04:10,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 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-07 01:04:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 3458 transitions. [2021-11-07 01:04:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-07 01:04:10,037 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:04:10,037 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-07 01:04:10,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 01:04:10,038 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:04:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:04:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1159844162, now seen corresponding path program 1 times [2021-11-07 01:04:10,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:04:10,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17353918] [2021-11-07 01:04:10,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:10,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:04:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:04:10,190 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:04:10,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17353918] [2021-11-07 01:04:10,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17353918] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:04:10,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042211714] [2021-11-07 01:04:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:04:10,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:04:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:04:10,200 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:04:10,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-07 01:04:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:04:11,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-07 01:04:11,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:04:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 01:04:11,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:04:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 01:04:11,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042211714] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 01:04:11,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 01:04:11,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 11 [2021-11-07 01:04:11,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082409100] [2021-11-07 01:04:11,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:04:11,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:04:11,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:04:11,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:04:11,964 INFO L87 Difference]: Start difference. First operand 3101 states and 3458 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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-07 01:04:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:04:12,180 INFO L93 Difference]: Finished difference Result 3714 states and 4129 transitions. [2021-11-07 01:04:12,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:04:12,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 145 [2021-11-07 01:04:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:04:12,181 INFO L225 Difference]: With dead ends: 3714 [2021-11-07 01:04:12,182 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 01:04:12,191 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:04:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 01:04:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 01:04:12,192 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-07 01:04:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 01:04:12,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2021-11-07 01:04:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:04:12,193 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 01:04:12,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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-07 01:04:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 01:04:12,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 01:04:12,197 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:04:12,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-07 01:04:12,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-07 01:04:12,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 01:04:12,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:12,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:12,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:13,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:13,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:13,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:13,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:13,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:13,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:14,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:14,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:14,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:14,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:14,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:14,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:15,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:15,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:15,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:15,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:15,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:15,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:15,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:16,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:16,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:16,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:17,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:17,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:17,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:17,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:17,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:17,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:17,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:18,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:18,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:18,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:18,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:19,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:19,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:19,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:19,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:19,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:19,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:19,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:19,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:20,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:20,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:04:58,036 INFO L853 garLoopResultBuilder]: At program point L697(lines 697 706) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1))) (let ((.cse16 (<= ~token~0 .cse23)) (.cse18 (<= .cse23 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (not .cse17)) (.cse15 (= 2 ~t3_st~0)) (.cse19 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse21 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse12 (= ~E_1~0 2)) (.cse13 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse10 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse14) (let ((.cse22 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse20 .cse14)) (and .cse0 .cse15 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse8 .cse19 .cse12 .cse20 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14)))) [2021-11-07 01:04:58,037 INFO L853 garLoopResultBuilder]: At program point L697-1(lines 697 706) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1))) (let ((.cse16 (<= ~token~0 .cse23)) (.cse18 (<= .cse23 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (not .cse17)) (.cse15 (= 2 ~t3_st~0)) (.cse19 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse21 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse12 (= ~E_1~0 2)) (.cse13 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse10 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse14) (let ((.cse22 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse20 .cse14)) (and .cse0 .cse15 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse8 .cse19 .cse12 .cse20 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14)))) [2021-11-07 01:04:58,037 INFO L853 garLoopResultBuilder]: At program point L103(lines 103 107) the Hoare annotation is: (let ((.cse5 (= ~t2_pc~0 1)) (.cse16 (= ~t1_pc~0 1)) (.cse22 (= ~m_st~0 0))) (let ((.cse17 (= 2 ~t3_st~0)) (.cse9 (= ~m_st~0 ~E_1~0)) (.cse21 (= ~t3_pc~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= ~E_3~0 2)) (.cse6 (= ~m_pc~0 1)) (.cse18 (not .cse22)) (.cse13 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= ~T1_E~0 2)) (.cse23 (not .cse16)) (.cse4 (= 0 ~t3_pc~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse24 (= ~E_3~0 ~E_1~0)) (.cse8 (= ~E_2~0 2)) (.cse25 (= ~m_pc~0 0)) (.cse10 (not (= ~t1_st~0 0))) (.cse19 (= 0 ~t2_st~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse20 (not .cse5)) (.cse26 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse14 (= ~E_1~0 2)) (.cse15 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse0 .cse3 .cse6 .cse8 .cse18 .cse10 .cse19 .cse20 .cse13 .cse14 .cse21) (and .cse16 .cse17 .cse0 .cse2 .cse3 .cse5 .cse6 .cse8 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21) (and .cse16 .cse0 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse10 .cse19 .cse20 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse22 .cse23 .cse7 .cse24 .cse8 .cse25 .cse10 .cse19 .cse11 .cse12 .cse20 .cse26 .cse14 .cse21) (and .cse17 .cse0 .cse1 .cse2 .cse22 .cse23 .cse5 .cse7 .cse24 .cse8 .cse25 .cse10 .cse11 .cse12 .cse26 .cse14 .cse21) (and .cse17 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse20 .cse13 .cse14 .cse21) (and .cse0 .cse1 .cse2 .cse22 .cse23 .cse4 .cse5 .cse7 .cse24 .cse8 .cse25 .cse10 .cse11 .cse12 .cse26 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse22 .cse23 .cse4 .cse7 .cse24 .cse8 .cse25 .cse10 .cse19 .cse11 .cse12 .cse20 .cse26 .cse14 .cse15)))) [2021-11-07 01:04:58,038 INFO L853 garLoopResultBuilder]: At program point L238(lines 226 240) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (not (= ~t1_pc~0 1)) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0)) [2021-11-07 01:04:58,038 INFO L853 garLoopResultBuilder]: At program point L238-1(lines 226 240) the Hoare annotation is: (let ((.cse9 (= ~t2_pc~0 1)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse3 (= 2 ~t2_st~0)) (.cse18 (= 2 ~t3_st~0)) (.cse21 (= 2 ~t1_st~0)) (.cse23 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 1)) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse19 (= ~t3_pc~0 1)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~T1_E~0 2)) (.cse4 (= ~E_1~0 1)) (.cse5 (not .cse20)) (.cse6 (= ~E_3~0 2)) (.cse7 (= 0 ~t3_pc~0)) (.cse8 (= ~t1_st~0 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= ~E_2~0 2)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~m_pc~0 0)) (.cse22 (= 0 ~t2_st~0)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse24 (not .cse9)) (.cse16 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse17 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19) (and .cse20 .cse1 .cse4 .cse21 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse23 .cse15 .cse24 .cse16 .cse17) (and .cse20 .cse18 .cse1 .cse3 .cse4 .cse21 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse25 .cse19) (and .cse20 .cse1 .cse3 .cse4 .cse21 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse24 .cse16 .cse19) (and .cse20 .cse18 .cse1 .cse4 .cse21 .cse6 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse23 .cse15 .cse24 .cse25 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse24 .cse16 .cse17)))) [2021-11-07 01:04:58,039 INFO L853 garLoopResultBuilder]: At program point L238-2(lines 226 240) the Hoare annotation is: (let ((.cse7 (= ~t2_pc~0 1)) (.cse20 (+ ~local~0 1))) (let ((.cse16 (= 2 ~t3_st~0)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (<= ~token~0 .cse20)) (.cse10 (<= .cse20 ~token~0)) (.cse19 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= 0 ~t3_pc~0)) (.cse8 (= ~m_pc~0 1)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~t1_st~0 0))) (.cse17 (= 0 ~t2_st~0)) (.cse18 (not .cse7)) (.cse13 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse14 (= ~E_1~0 2)) (.cse15 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse2 .cse5 .cse8 .cse9 .cse11 .cse12 .cse17 .cse18 .cse13 .cse14 .cse19) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse17 .cse18 .cse13 .cse14 .cse15)))) [2021-11-07 01:04:58,039 INFO L857 garLoopResultBuilder]: For program point L172(lines 172 180) no Hoare annotation was computed. [2021-11-07 01:04:58,039 INFO L853 garLoopResultBuilder]: At program point L238-3(lines 226 240) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (< 0 ~t2_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~E_2~0 2)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2))) (or (let ((.cse2 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse2 ~token~0) (<= ~token~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~t3_pc~0 1))) (and .cse0 .cse1 .cse3 .cse4 (= 0 ~t3_pc~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t3_st~0)))) [2021-11-07 01:04:58,040 INFO L853 garLoopResultBuilder]: At program point L238-4(lines 226 240) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (< 0 ~t3_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2)) (.cse11 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11))) [2021-11-07 01:04:58,040 INFO L853 garLoopResultBuilder]: At program point L238-5(lines 226 240) the Hoare annotation is: (let ((.cse18 (= ~t2_pc~0 1)) (.cse21 (+ ~local~0 1))) (let ((.cse3 (<= ~token~0 .cse21)) (.cse9 (<= .cse21 ~token~0)) (.cse12 (= 0 ~t2_st~0)) (.cse15 (not .cse18)) (.cse6 (= 0 ~t3_pc~0)) (.cse14 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse16 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse17 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse13 (= ~E_1~0 2)) (.cse19 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse13 .cse14) (and .cse0 .cse16 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse17 .cse4 .cse5 .cse18 .cse7 .cse10 .cse13 .cse19 (< ~token~0 (+ ~local~0 4)) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (let ((.cse20 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse20 ~token~0) (<= ~token~0 .cse20) .cse2 .cse17 .cse4 .cse5 .cse18 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse19)) (and .cse0 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse13 .cse19) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse16 .cse1 .cse2 .cse17 .cse4 .cse5 .cse18 .cse7 .cse8 .cse10 .cse11 .cse13 .cse19)))) [2021-11-07 01:04:58,041 INFO L853 garLoopResultBuilder]: At program point L238-6(lines 226 240) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1))) (let ((.cse16 (<= ~token~0 .cse23)) (.cse18 (<= .cse23 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (not .cse17)) (.cse15 (= 2 ~t3_st~0)) (.cse19 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse21 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse12 (= ~E_1~0 2)) (.cse13 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse10 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse14) (let ((.cse22 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse20 .cse14)) (and .cse0 .cse15 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse8 .cse19 .cse12 .cse20 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14)))) [2021-11-07 01:04:58,041 INFO L853 garLoopResultBuilder]: At program point L175(lines 175 179) the Hoare annotation is: (let ((.cse0 (+ 2 ~local~0))) (and (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= .cse0 ~token~0) (<= ~token~0 .cse0) (<= 2 ~E_M~0) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (< 0 ~t3_st~0) (= ~E_3~0 2) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2) (= ~t3_pc~0 1))) [2021-11-07 01:04:58,042 INFO L853 garLoopResultBuilder]: At program point L111-1(lines 99 130) the Hoare annotation is: (let ((.cse5 (= ~t2_pc~0 1)) (.cse23 (= ~m_st~0 0)) (.cse28 (+ ~local~0 1))) (let ((.cse18 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse19 (<= ~token~0 .cse28)) (.cse20 (<= .cse28 ~token~0)) (.cse1 (= ~T1_E~0 2)) (.cse9 (= ~m_st~0 ~E_1~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse26 (= 2 ~t3_st~0)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= ~m_pc~0 1)) (.cse17 (not .cse23)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (not .cse5)) (.cse13 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse27 (= ~t3_pc~0 1)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= ~E_3~0 2)) (.cse4 (= 0 ~t3_pc~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse24 (= ~m_pc~0 0)) (.cse10 (not (= ~t1_st~0 0))) (.cse25 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse14 (= ~E_1~0 2)) (.cse15 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse13 .cse14 .cse15 .cse18) (and .cse16 .cse0 .cse19 .cse3 (not .cse18) .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse17 .cse10 .cse21 .cse13 .cse14 .cse15) (and (= ~t1_pc~0 1) .cse16 .cse0 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse10 .cse21 .cse22 .cse13 .cse14 .cse15) (and .cse0 .cse23 .cse3 .cse4 .cse7 .cse8 .cse24 .cse10 .cse21 .cse22 .cse25 .cse14 .cse15) (and .cse26 .cse16 .cse0 .cse2 .cse3 .cse5 .cse6 .cse8 .cse17 .cse10 .cse13 .cse14 .cse27 .cse18) (and .cse26 .cse0 .cse2 .cse23 .cse3 .cse5 .cse7 .cse8 .cse24 .cse10 .cse25 .cse14 .cse27) (and .cse26 .cse16 .cse0 .cse19 .cse3 .cse6 .cse20 .cse8 .cse17 .cse10 .cse21 .cse13 .cse14 .cse27) (and .cse26 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse27) (and .cse26 .cse0 .cse23 .cse3 .cse7 .cse8 .cse24 .cse10 .cse21 .cse22 .cse25 .cse14 .cse27) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27) (and .cse26 .cse16 .cse0 .cse3 .cse6 .cse8 .cse17 .cse10 .cse21 .cse22 .cse13 .cse14 .cse27) (and .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse7 .cse8 .cse24 .cse10 .cse25 .cse14 .cse15)))) [2021-11-07 01:04:58,043 INFO L853 garLoopResultBuilder]: At program point L376(lines 352 418) the Hoare annotation is: (let ((.cse19 (= ~t2_pc~0 1)) (.cse22 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse34 (+ ~local~0 1))) (let ((.cse31 (<= ~token~0 .cse34)) (.cse32 (<= .cse34 ~token~0)) (.cse18 (= ~E_1~0 ~t1_st~0)) (.cse29 (not .cse0)) (.cse30 (= ~E_3~0 ~E_1~0)) (.cse23 (= ~m_pc~0 0)) (.cse24 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse20 (= 2 ~t3_st~0)) (.cse33 (not (= ~E_3~0 1))) (.cse21 (= ~t3_pc~0 1)) (.cse2 (= ~T1_E~0 2)) (.cse17 (= 2 ~t2_st~0)) (.cse28 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 ~E_1~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse25 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse27 (not .cse22)) (.cse10 (= 0 ~t2_st~0)) (.cse13 (not .cse19)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse15 (= ~E_1~0 2)) (.cse16 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse18 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse0 .cse20 .cse1 .cse2 .cse17 .cse18 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21) (and .cse0 .cse20 .cse1 .cse17 .cse22 .cse3 .cse4 .cse19 .cse7 .cse8 .cse23 .cse24 .cse15 .cse21) (let ((.cse26 (+ 2 ~local~0))) (and .cse0 .cse25 (<= .cse26 ~token~0) (<= ~token~0 .cse26) .cse1 .cse17 .cse3 .cse4 .cse19 .cse6 .cse8 .cse27 .cse14 .cse15 .cse16 .cse21)) (and .cse0 .cse1 .cse17 .cse22 .cse3 .cse4 .cse5 .cse19 .cse7 .cse8 .cse23 .cse24 .cse15 .cse16) (and .cse0 .cse20 .cse1 .cse22 .cse3 .cse4 .cse7 .cse8 .cse23 .cse10 .cse13 .cse24 .cse15 .cse21) (and .cse20 .cse1 .cse2 .cse4 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (and .cse1 .cse2 .cse17 .cse22 .cse29 .cse5 .cse28 .cse19 .cse7 .cse30 .cse8 .cse23 .cse11 .cse12 .cse24 .cse15 .cse16) (and .cse0 .cse25 .cse1 .cse17 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse27 .cse14 .cse15 .cse16) (and .cse0 .cse20 .cse25 (<= (+ 3 ~local~0) ~token~0) .cse1 .cse17 .cse3 .cse4 .cse19 .cse6 .cse8 .cse14 .cse15 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse20 .cse1 .cse2 .cse17 .cse22 .cse29 .cse28 .cse19 .cse7 .cse30 .cse8 .cse23 .cse11 .cse12 .cse24 .cse15 .cse21) (and .cse20 .cse1 .cse2 .cse17 .cse4 .cse28 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21) (and .cse0 .cse20 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse27 .cse10 .cse13 .cse14 .cse15 .cse21) (and .cse0 .cse1 .cse22 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse10 .cse13 .cse24 .cse15 .cse16) (and .cse0 .cse25 .cse1 .cse31 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse27 .cse10 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse17 .cse4 .cse5 .cse28 .cse19 .cse6 .cse7 .cse8 .cse27 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse0 .cse20 .cse25 .cse1 .cse31 .cse3 .cse4 .cse33 .cse6 .cse32 .cse8 .cse27 .cse10 .cse14 .cse15 .cse21) (and .cse0 .cse20 .cse1 .cse2 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (and .cse0 .cse20 .cse1 .cse4 .cse28 .cse6 .cse8 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse22 .cse29 .cse5 .cse28 .cse7 .cse30 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse15 .cse16) (and .cse0 .cse20 .cse1 .cse17 .cse4 .cse28 .cse33 .cse19 .cse6 .cse8 .cse27 .cse11 .cse12 .cse14 .cse15 .cse21) (and .cse20 .cse1 .cse2 .cse22 .cse29 .cse28 .cse7 .cse30 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse15 .cse21) (and .cse0 .cse20 .cse25 .cse1 .cse17 .cse3 .cse4 .cse33 .cse19 .cse6 .cse8 .cse27 .cse14 .cse15 .cse21) (and .cse1 .cse2 .cse17 .cse4 .cse5 .cse28 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse10 .cse13 .cse14 .cse15 .cse16)))) [2021-11-07 01:04:58,043 INFO L857 garLoopResultBuilder]: For program point L246(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,043 INFO L857 garLoopResultBuilder]: For program point L246-2(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,043 INFO L857 garLoopResultBuilder]: For program point L246-3(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,044 INFO L857 garLoopResultBuilder]: For program point L246-5(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,044 INFO L857 garLoopResultBuilder]: For program point L246-6(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,044 INFO L857 garLoopResultBuilder]: For program point L246-8(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,044 INFO L857 garLoopResultBuilder]: For program point L246-9(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,044 INFO L857 garLoopResultBuilder]: For program point L246-11(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,044 INFO L857 garLoopResultBuilder]: For program point L246-12(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,045 INFO L857 garLoopResultBuilder]: For program point L246-14(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,045 INFO L857 garLoopResultBuilder]: For program point L246-15(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,045 INFO L857 garLoopResultBuilder]: For program point L246-17(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,045 INFO L857 garLoopResultBuilder]: For program point L246-18(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,045 INFO L857 garLoopResultBuilder]: For program point L246-20(lines 246 255) no Hoare annotation was computed. [2021-11-07 01:04:58,046 INFO L857 garLoopResultBuilder]: For program point L379(lines 379 386) no Hoare annotation was computed. [2021-11-07 01:04:58,046 INFO L857 garLoopResultBuilder]: For program point L247(lines 247 252) no Hoare annotation was computed. [2021-11-07 01:04:58,046 INFO L857 garLoopResultBuilder]: For program point L247-1(lines 247 252) no Hoare annotation was computed. [2021-11-07 01:04:58,046 INFO L857 garLoopResultBuilder]: For program point L247-2(lines 247 252) no Hoare annotation was computed. [2021-11-07 01:04:58,046 INFO L857 garLoopResultBuilder]: For program point L247-3(lines 247 252) no Hoare annotation was computed. [2021-11-07 01:04:58,046 INFO L857 garLoopResultBuilder]: For program point L247-4(lines 247 252) no Hoare annotation was computed. [2021-11-07 01:04:58,047 INFO L857 garLoopResultBuilder]: For program point L247-5(lines 247 252) no Hoare annotation was computed. [2021-11-07 01:04:58,047 INFO L857 garLoopResultBuilder]: For program point L247-6(lines 247 252) no Hoare annotation was computed. [2021-11-07 01:04:58,047 INFO L857 garLoopResultBuilder]: For program point L710(lines 710 714) no Hoare annotation was computed. [2021-11-07 01:04:58,047 INFO L853 garLoopResultBuilder]: At program point L183-1(lines 171 202) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 0)) (.cse7 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse25 (not .cse0)) (.cse26 (= ~E_3~0 ~E_1~0)) (.cse2 (= ~T1_E~0 2)) (.cse4 (< 0 ~t3_st~0)) (.cse6 (= 0 ~t3_pc~0)) (.cse24 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 ~E_1~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse20 (not .cse7)) (.cse3 (= 2 ~t2_st~0)) (.cse22 (= ~m_pc~0 0)) (.cse23 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (<= 2 ~E_M~0)) (.cse17 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse8 (= ~m_pc~0 1)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ~E_2~0 2)) (.cse18 (not .cse21)) (.cse19 (= 0 ~t2_st~0)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse15 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~E_1~0 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse17 .cse5 .cse8 .cse9 .cse10 .cse18 .cse19 .cse20 .cse14 .cse15) (and .cse0 .cse1 .cse21 .cse17 .cse5 .cse6 .cse9 .cse10 .cse22 .cse19 .cse20 .cse23 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse20 .cse14 .cse15) (and .cse0 .cse1 .cse5 .cse24 .cse8 .cse9 .cse10 .cse18 .cse19 .cse12 .cse13 .cse20 .cse14 .cse15) (and .cse0 .cse16 (<= (+ 3 ~local~0) ~token~0) .cse1 .cse3 .cse17 .cse5 .cse7 .cse8 .cse10 .cse14 .cse15 (< ~token~0 (+ ~local~0 4)) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse1 .cse2 .cse3 .cse21 .cse25 .cse6 .cse24 .cse7 .cse9 .cse26 .cse10 .cse22 .cse12 .cse13 .cse23 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse3 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse18 .cse14 .cse15) (and .cse1 .cse2 .cse21 .cse25 .cse6 .cse24 .cse9 .cse26 .cse10 .cse22 .cse19 .cse12 .cse13 .cse20 .cse23 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse18 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse20 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse21 .cse17 .cse5 .cse7 .cse9 .cse10 .cse22 .cse23 .cse15) (let ((.cse27 (+ ~local~0 1))) (and .cse0 .cse16 .cse1 (<= ~token~0 .cse27) .cse17 .cse5 .cse8 .cse9 (<= .cse27 ~token~0) .cse10 .cse18 .cse19 .cse14 .cse15))))) [2021-11-07 01:04:58,048 INFO L860 garLoopResultBuilder]: At program point L716(lines 663 721) the Hoare annotation is: true [2021-11-07 01:04:58,048 INFO L857 garLoopResultBuilder]: For program point L56(lines 56 64) no Hoare annotation was computed. [2021-11-07 01:04:58,048 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 01:04:58,048 INFO L853 garLoopResultBuilder]: At program point L257(lines 245 259) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (not (= ~t1_pc~0 1)) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-11-07 01:04:58,048 INFO L853 garLoopResultBuilder]: At program point L257-1(lines 245 259) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse23 (= ~t2_pc~0 1))) (let ((.cse15 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 1)) (.cse22 (= 0 ~t3_pc~0)) (.cse25 (= 0 ~t3_st~0)) (.cse10 (= 0 ~t2_st~0)) (.cse14 (not .cse23)) (.cse1 (= 2 ~t3_st~0)) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse19 (= ~T1_E~0 2)) (.cse20 (= 2 ~t2_st~0)) (.cse3 (= ~E_1~0 1)) (.cse21 (not .cse0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse24 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse16 (= ~t3_pc~0 1)) (.cse17 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse2 .cse19 .cse20 .cse3 .cse21 .cse4 .cse22 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse24 .cse25 .cse17) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse25 .cse17) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse22 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse24 .cse25 .cse17) (and .cse18 .cse2 .cse19 .cse3 .cse21 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse24 .cse25 .cse17) (and .cse1 .cse18 .cse2 .cse19 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse24 .cse16 .cse17) (and .cse1 .cse18 .cse2 .cse19 .cse20 .cse3 .cse21 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse24 .cse16 .cse17)))) [2021-11-07 01:04:58,049 INFO L853 garLoopResultBuilder]: At program point L257-2(lines 245 259) the Hoare annotation is: (let ((.cse23 (+ ~local~0 1)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (= ~t2_pc~0 1))) (let ((.cse5 (= 0 ~t3_pc~0)) (.cse13 (= 0 ~t3_st~0)) (.cse16 (not .cse6)) (.cse3 (= 2 ~t2_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (not .cse14)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (= 2 ~t3_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse17 (<= ~token~0 .cse23)) (.cse4 (= ~E_3~0 2)) (.cse22 (not (= ~E_3~0 1))) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= .cse23 ~token~0)) (.cse9 (not (= ~m_st~0 0))) (.cse15 (= 0 ~t2_st~0)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ~E_1~0 2)) (.cse21 (= ~t3_pc~0 1)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse20 .cse1 .cse2 .cse4 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse11 .cse12 .cse21 .cse14) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse14) (and .cse1 (or (and .cse0 .cse20 .cse2 .cse17 .cse4 .cse18 .cse22 .cse6 .cse7 .cse8 .cse19 .cse9 .cse11 .cse12 .cse21) (and .cse0 .cse20 .cse2 .cse17 .cse4 .cse22 .cse6 .cse7 .cse8 .cse19 .cse9 .cse15 .cse11 .cse12 .cse21)) .cse10)))) [2021-11-07 01:04:58,049 INFO L853 garLoopResultBuilder]: At program point L257-3(lines 245 259) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (< 0 ~t2_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~E_2~0 2)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2))) (or (let ((.cse2 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse2 ~token~0) (<= ~token~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~t3_pc~0 1))) (and .cse0 .cse1 .cse3 .cse4 (= 0 ~t3_pc~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t3_st~0)))) [2021-11-07 01:04:58,049 INFO L853 garLoopResultBuilder]: At program point L257-4(lines 245 259) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (< 0 ~t3_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2)) (.cse11 (= ~t3_pc~0 1)) (.cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4)) .cse12))) [2021-11-07 01:04:58,049 INFO L853 garLoopResultBuilder]: At program point L257-5(lines 245 259) the Hoare annotation is: (let ((.cse22 (+ ~local~0 1)) (.cse18 (= ~t2_pc~0 1))) (let ((.cse11 (not .cse18)) (.cse1 (= 2 ~t3_st~0)) (.cse19 (<= ~token~0 .cse22)) (.cse20 (<= .cse22 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse13 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (<= 2 ~E_M~0)) (.cse17 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse15 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse12 (= ~E_1~0 2)) (.cse16 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse17 .cse4 .cse5 .cse18 .cse6 .cse8 .cse12 .cse13 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse19 .cse4 .cse5 .cse15 .cse18 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse12 .cse16) (let ((.cse21 (+ 2 ~local~0))) (and .cse0 .cse2 (<= .cse21 ~token~0) (<= ~token~0 .cse21) .cse3 .cse17 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse12 .cse16 .cse13 .cse14)) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse18 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse17 .cse4 .cse5 .cse15 .cse18 .cse6 .cse7 .cse8 .cse9 .cse12 .cse16 .cse14)))) [2021-11-07 01:04:58,049 INFO L857 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2021-11-07 01:04:58,050 INFO L853 garLoopResultBuilder]: At program point L257-6(lines 245 259) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1))) (let ((.cse16 (<= ~token~0 .cse23)) (.cse18 (<= .cse23 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (not .cse17)) (.cse15 (= 2 ~t3_st~0)) (.cse19 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse21 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse12 (= ~E_1~0 2)) (.cse13 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse10 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse14) (let ((.cse22 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse20 .cse14)) (and .cse0 .cse15 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse8 .cse19 .cse12 .cse20 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14)))) [2021-11-07 01:04:58,050 INFO L853 garLoopResultBuilder]: At program point L390(lines 352 418) the Hoare annotation is: (let ((.cse20 (= ~t2_pc~0 1)) (.cse22 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse34 (+ ~local~0 1))) (let ((.cse31 (<= ~token~0 .cse34)) (.cse32 (<= .cse34 ~token~0)) (.cse19 (= ~E_1~0 ~t1_st~0)) (.cse29 (not .cse0)) (.cse30 (= ~E_3~0 ~E_1~0)) (.cse23 (= ~m_pc~0 0)) (.cse24 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse17 (= 2 ~t3_st~0)) (.cse33 (not (= ~E_3~0 1))) (.cse21 (= ~t3_pc~0 1)) (.cse2 (= ~T1_E~0 2)) (.cse18 (= 2 ~t2_st~0)) (.cse28 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 ~E_1~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse25 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse27 (not .cse22)) (.cse10 (= 0 ~t2_st~0)) (.cse13 (not .cse20)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse15 (= ~E_1~0 2)) (.cse16 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse18 .cse19 .cse4 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21) (and .cse0 .cse17 .cse1 .cse18 .cse22 .cse3 .cse4 .cse20 .cse7 .cse8 .cse23 .cse24 .cse15 .cse21) (let ((.cse26 (+ 2 ~local~0))) (and .cse0 .cse25 (<= .cse26 ~token~0) (<= ~token~0 .cse26) .cse1 .cse18 .cse3 .cse4 .cse20 .cse6 .cse8 .cse27 .cse14 .cse15 .cse16 .cse21)) (and .cse0 .cse1 .cse18 .cse22 .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse23 .cse24 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse22 .cse3 .cse4 .cse7 .cse8 .cse23 .cse10 .cse13 .cse24 .cse15 .cse21) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse4 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (and .cse1 .cse2 .cse18 .cse22 .cse29 .cse5 .cse28 .cse20 .cse7 .cse30 .cse8 .cse23 .cse11 .cse12 .cse24 .cse15 .cse16) (and .cse0 .cse25 .cse1 .cse18 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse27 .cse14 .cse15 .cse16) (and .cse0 .cse17 .cse25 (<= (+ 3 ~local~0) ~token~0) .cse1 .cse18 .cse3 .cse4 .cse20 .cse6 .cse8 .cse14 .cse15 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse17 .cse1 .cse2 .cse18 .cse22 .cse29 .cse28 .cse20 .cse7 .cse30 .cse8 .cse23 .cse11 .cse12 .cse24 .cse15 .cse21) (and .cse17 .cse1 .cse2 .cse18 .cse4 .cse28 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21) (and .cse0 .cse17 .cse25 .cse1 .cse3 .cse4 .cse6 .cse8 .cse27 .cse10 .cse13 .cse14 .cse15 .cse21) (and .cse0 .cse1 .cse22 .cse3 .cse4 .cse5 .cse7 .cse8 .cse23 .cse10 .cse13 .cse24 .cse15 .cse16) (and .cse0 .cse25 .cse1 .cse31 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse27 .cse10 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse18 .cse4 .cse5 .cse28 .cse20 .cse6 .cse7 .cse8 .cse27 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse0 .cse17 .cse25 .cse1 .cse31 .cse3 .cse4 .cse33 .cse6 .cse32 .cse8 .cse27 .cse10 .cse14 .cse15 .cse21) (and .cse0 .cse17 .cse1 .cse2 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (and .cse0 .cse17 .cse1 .cse4 .cse28 .cse6 .cse8 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (and .cse0 .cse1 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse22 .cse29 .cse5 .cse28 .cse7 .cse30 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse4 .cse28 .cse33 .cse20 .cse6 .cse8 .cse27 .cse11 .cse12 .cse14 .cse15 .cse21) (and .cse17 .cse1 .cse2 .cse22 .cse29 .cse28 .cse7 .cse30 .cse8 .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 .cse15 .cse21) (and .cse0 .cse17 .cse25 .cse1 .cse18 .cse3 .cse4 .cse33 .cse20 .cse6 .cse8 .cse27 .cse14 .cse15 .cse21) (and .cse1 .cse2 .cse18 .cse4 .cse5 .cse28 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse10 .cse13 .cse14 .cse15 .cse16)))) [2021-11-07 01:04:58,051 INFO L853 garLoopResultBuilder]: At program point L60(lines 55 94) the Hoare annotation is: (and (= ~t1_pc~0 1) (= 2 ~t3_st~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= (+ 3 ~local~0) ~token~0) (<= 2 ~E_M~0) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~E_3~0 2) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2) (= ~t3_pc~0 1) (< ~token~0 (+ ~local~0 4))) [2021-11-07 01:04:58,051 INFO L857 garLoopResultBuilder]: For program point L393(lines 393 400) no Hoare annotation was computed. [2021-11-07 01:04:58,051 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-11-07 01:04:58,051 INFO L857 garLoopResultBuilder]: For program point L265(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,051 INFO L857 garLoopResultBuilder]: For program point L265-2(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,052 INFO L857 garLoopResultBuilder]: For program point L265-3(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,052 INFO L857 garLoopResultBuilder]: For program point L265-5(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,052 INFO L857 garLoopResultBuilder]: For program point L265-6(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,052 INFO L857 garLoopResultBuilder]: For program point L265-8(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,052 INFO L857 garLoopResultBuilder]: For program point L265-9(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,052 INFO L857 garLoopResultBuilder]: For program point L265-11(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,053 INFO L857 garLoopResultBuilder]: For program point L265-12(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,053 INFO L857 garLoopResultBuilder]: For program point L265-14(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,053 INFO L857 garLoopResultBuilder]: For program point L265-15(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,053 INFO L857 garLoopResultBuilder]: For program point L265-17(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,053 INFO L857 garLoopResultBuilder]: For program point L265-18(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,053 INFO L857 garLoopResultBuilder]: For program point L265-20(lines 265 274) no Hoare annotation was computed. [2021-11-07 01:04:58,054 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 271) no Hoare annotation was computed. [2021-11-07 01:04:58,054 INFO L857 garLoopResultBuilder]: For program point L266-1(lines 266 271) no Hoare annotation was computed. [2021-11-07 01:04:58,054 INFO L857 garLoopResultBuilder]: For program point L266-2(lines 266 271) no Hoare annotation was computed. [2021-11-07 01:04:58,054 INFO L857 garLoopResultBuilder]: For program point L266-3(lines 266 271) no Hoare annotation was computed. [2021-11-07 01:04:58,054 INFO L857 garLoopResultBuilder]: For program point L266-4(lines 266 271) no Hoare annotation was computed. [2021-11-07 01:04:58,055 INFO L857 garLoopResultBuilder]: For program point L266-5(lines 266 271) no Hoare annotation was computed. [2021-11-07 01:04:58,055 INFO L857 garLoopResultBuilder]: For program point L266-6(lines 266 271) no Hoare annotation was computed. [2021-11-07 01:04:58,055 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2021-11-07 01:04:58,055 INFO L853 garLoopResultBuilder]: At program point L139(lines 139 143) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse16 (= ~t3_pc~0 1)) (.cse20 (= ~m_st~0 0))) (let ((.cse10 (= ~m_st~0 ~E_1~0)) (.cse1 (= 2 ~t3_st~0)) (.cse25 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse26 (not .cse20)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~T1_E~0 2)) (.cse27 (not .cse16)) (.cse21 (not .cse0)) (.cse17 (= 0 ~t3_pc~0)) (.cse18 (= ~t1_st~0 0)) (.cse6 (< 0 ~t2_st~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse22 (= ~E_3~0 ~E_1~0)) (.cse9 (= ~E_2~0 2)) (.cse23 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (not (= ~t2_pc~0 1))) (.cse24 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse15 (= ~E_1~0 2)) (.cse19 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse5 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse1 .cse2 .cse3 .cse20 .cse21 .cse18 .cse6 .cse8 .cse22 .cse9 .cse23 .cse11 .cse12 .cse13 .cse24 .cse15 .cse16) (and .cse0 .cse1 .cse25 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse25 .cse2 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse26 .cse14 .cse15 .cse19) (and .cse0 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse8 .cse9 .cse23 .cse13 .cse24 .cse15 .cse16) (and .cse0 .cse2 .cse5 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse0 .cse2 .cse27 .cse20 .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse23 .cse13 .cse24 .cse15 .cse19) (let ((.cse28 (+ ~local~0 1))) (and .cse0 .cse1 .cse25 .cse2 (<= ~token~0 .cse28) .cse4 .cse5 .cse6 .cse7 (<= .cse28 ~token~0) .cse9 .cse26 .cse14 .cse15 .cse16)) (and .cse2 .cse3 .cse27 .cse20 .cse21 .cse17 .cse18 .cse6 .cse8 .cse22 .cse9 .cse23 .cse11 .cse12 .cse13 .cse24 .cse15 .cse19)))) [2021-11-07 01:04:58,056 INFO L853 garLoopResultBuilder]: At program point L404(lines 352 418) the Hoare annotation is: (let ((.cse24 (= ~m_st~0 0)) (.cse35 (+ ~local~0 1)) (.cse17 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse32 (<= (+ 3 ~local~0) ~token~0)) (.cse33 (< ~token~0 (+ ~local~0 4))) (.cse34 (= ~E_1~0 ~t1_st~0)) (.cse30 (not .cse0)) (.cse31 (= ~E_3~0 ~E_1~0)) (.cse25 (= ~m_pc~0 0)) (.cse27 (not .cse17)) (.cse26 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse19 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (<= ~token~0 .cse35)) (.cse4 (= 2 ~t1_st~0)) (.cse9 (<= .cse35 ~token~0)) (.cse11 (not .cse24)) (.cse12 (= 0 ~t2_st~0)) (.cse18 (= ~t3_pc~0 1)) (.cse2 (<= 2 ~E_M~0)) (.cse28 (= ~T1_E~0 2)) (.cse16 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= 0 ~t3_pc~0)) (.cse20 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ~E_2~0 2)) (.cse29 (= ~m_st~0 ~E_1~0)) (.cse21 (<= ~token~0 ~local~0)) (.cse22 (<= ~local~0 ~token~0)) (.cse23 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse2 .cse16 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse13 .cse14 .cse18)) (and .cse0 .cse19 .cse2 .cse16 .cse5 .cse20 .cse17 .cse7 .cse10 .cse11 .cse21 .cse22 .cse23 .cse13 .cse18) (and .cse0 .cse19 .cse2 .cse16 .cse24 .cse4 .cse5 .cse17 .cse8 .cse10 .cse25 .cse26 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14) (and .cse0 .cse2 .cse16 .cse24 .cse4 .cse5 .cse6 .cse17 .cse8 .cse10 .cse25 .cse26 .cse13 .cse14) (and .cse0 .cse19 .cse2 .cse24 .cse4 .cse5 .cse8 .cse10 .cse25 .cse12 .cse27 .cse26 .cse13 .cse18) (and .cse0 .cse2 .cse28 .cse16 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse29 .cse21 .cse22 .cse23 .cse13 .cse14) (and .cse19 .cse2 .cse28 .cse5 .cse20 .cse7 .cse8 .cse10 .cse29 .cse12 .cse21 .cse22 .cse27 .cse23 .cse13 .cse18) (and .cse2 .cse28 .cse16 .cse24 .cse30 .cse6 .cse20 .cse17 .cse8 .cse31 .cse10 .cse25 .cse21 .cse22 .cse26 .cse13 .cse14) (and .cse0 .cse19 .cse1 .cse32 .cse2 .cse16 .cse4 .cse5 .cse17 .cse7 .cse10 .cse13 .cse18 .cse33 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse0 .cse19 .cse2 .cse28 .cse16 .cse4 .cse5 .cse17 .cse7 .cse8 .cse10 .cse29 .cse21 .cse22 .cse23 .cse13 .cse18) (and .cse0 .cse19 .cse1 .cse32 .cse2 .cse16 .cse4 .cse5 .cse17 .cse7 .cse10 .cse23 .cse13 .cse18 .cse33) (and .cse19 .cse2 .cse28 .cse16 .cse24 .cse30 .cse20 .cse17 .cse8 .cse31 .cse10 .cse25 .cse21 .cse22 .cse26 .cse13 .cse18) (and .cse19 .cse2 .cse28 .cse16 .cse5 .cse20 .cse17 .cse7 .cse8 .cse10 .cse29 .cse21 .cse22 .cse23 .cse13 .cse18) (and .cse0 .cse19 .cse1 .cse2 .cse4 .cse5 .cse7 .cse10 .cse11 .cse12 .cse27 .cse13 .cse18) (and .cse0 .cse19 .cse1 .cse2 .cse16 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse13 .cse18) (and .cse2 .cse28 .cse24 .cse30 .cse6 .cse20 .cse8 .cse31 .cse10 .cse25 .cse12 .cse21 .cse22 .cse27 .cse13 .cse14) (and .cse0 .cse2 .cse24 .cse4 .cse5 .cse6 .cse8 .cse10 .cse25 .cse12 .cse27 .cse26 .cse13 .cse14) (and .cse0 .cse2 .cse16 .cse5 .cse6 .cse20 .cse17 .cse7 .cse8 .cse10 .cse11 .cse21 .cse22 .cse23 .cse13 .cse14) (and .cse0 .cse19 .cse2 .cse28 .cse34 .cse5 .cse7 .cse8 .cse10 .cse29 .cse12 .cse21 .cse22 .cse27 .cse23 .cse13 .cse18) (and .cse0 .cse19 .cse2 .cse5 .cse20 .cse7 .cse10 .cse11 .cse12 .cse21 .cse22 .cse27 .cse23 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse2 .cse5 .cse6 .cse20 .cse7 .cse8 .cse10 .cse11 .cse12 .cse21 .cse22 .cse27 .cse23 .cse13 .cse14) (and .cse0 .cse2 .cse28 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse12 .cse21 .cse22 .cse27 .cse23 .cse13 .cse14) (and .cse2 .cse28 .cse5 .cse6 .cse20 .cse7 .cse8 .cse10 .cse29 .cse12 .cse21 .cse22 .cse27 .cse23 .cse13 .cse14) (and .cse19 .cse2 .cse28 .cse24 .cse30 .cse20 .cse8 .cse31 .cse10 .cse25 .cse12 .cse21 .cse22 .cse27 .cse26 .cse13 .cse18) (and .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18) (and .cse2 .cse28 .cse16 .cse5 .cse6 .cse20 .cse17 .cse7 .cse8 .cse10 .cse29 .cse21 .cse22 .cse23 .cse13 .cse14)))) [2021-11-07 01:04:58,056 INFO L857 garLoopResultBuilder]: For program point L208(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,057 INFO L857 garLoopResultBuilder]: For program point L208-2(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,057 INFO L857 garLoopResultBuilder]: For program point L208-3(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,057 INFO L857 garLoopResultBuilder]: For program point L208-5(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,057 INFO L857 garLoopResultBuilder]: For program point L208-6(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,057 INFO L857 garLoopResultBuilder]: For program point L208-8(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,057 INFO L857 garLoopResultBuilder]: For program point L208-9(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,058 INFO L857 garLoopResultBuilder]: For program point L208-11(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,058 INFO L857 garLoopResultBuilder]: For program point L208-12(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,058 INFO L857 garLoopResultBuilder]: For program point L208-14(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,058 INFO L857 garLoopResultBuilder]: For program point L208-15(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,058 INFO L857 garLoopResultBuilder]: For program point L208-17(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,059 INFO L857 garLoopResultBuilder]: For program point L208-18(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,059 INFO L857 garLoopResultBuilder]: For program point L208-20(lines 208 217) no Hoare annotation was computed. [2021-11-07 01:04:58,059 INFO L857 garLoopResultBuilder]: For program point L407(lines 407 414) no Hoare annotation was computed. [2021-11-07 01:04:58,059 INFO L857 garLoopResultBuilder]: For program point L209(lines 209 214) no Hoare annotation was computed. [2021-11-07 01:04:58,059 INFO L857 garLoopResultBuilder]: For program point L209-1(lines 209 214) no Hoare annotation was computed. [2021-11-07 01:04:58,059 INFO L857 garLoopResultBuilder]: For program point L209-2(lines 209 214) no Hoare annotation was computed. [2021-11-07 01:04:58,060 INFO L857 garLoopResultBuilder]: For program point L209-3(lines 209 214) no Hoare annotation was computed. [2021-11-07 01:04:58,060 INFO L857 garLoopResultBuilder]: For program point L209-4(lines 209 214) no Hoare annotation was computed. [2021-11-07 01:04:58,060 INFO L857 garLoopResultBuilder]: For program point L209-5(lines 209 214) no Hoare annotation was computed. [2021-11-07 01:04:58,060 INFO L857 garLoopResultBuilder]: For program point L209-6(lines 209 214) no Hoare annotation was computed. [2021-11-07 01:04:58,060 INFO L853 garLoopResultBuilder]: At program point L276(lines 264 278) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (not (= ~t1_pc~0 1)) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-11-07 01:04:58,061 INFO L853 garLoopResultBuilder]: At program point L276-1(lines 264 278) the Hoare annotation is: (let ((.cse9 (= ~t2_pc~0 1)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse22 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse4 (= 2 ~t2_st~0)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 1)) (.cse23 (= 0 ~t3_pc~0)) (.cse24 (= 0 ~t3_st~0)) (.cse0 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~T1_E~0 2)) (.cse5 (= ~E_1~0 1)) (.cse6 (not .cse20)) (.cse7 (= ~E_3~0 2)) (.cse8 (= ~t1_st~0 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= ~E_2~0 2)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse14 (= ~m_pc~0 0)) (.cse25 (= 0 ~t2_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse26 (not .cse9)) (.cse17 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse18 (= ~t3_pc~0 1)) (.cse19 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16 .cse22 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse24 .cse19) (and .cse20 .cse2 .cse5 .cse7 .cse23 .cse8 .cse10 .cse11 .cse12 .cse14 .cse25 .cse15 .cse21 .cse16 .cse26 .cse17 .cse24 .cse19) (and .cse20 .cse0 .cse2 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse21 .cse16 .cse26 .cse22 .cse18 .cse19) (and .cse20 .cse2 .cse4 .cse5 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse21 .cse16 .cse17 .cse24 .cse19) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse23 .cse8 .cse10 .cse11 .cse12 .cse14 .cse25 .cse15 .cse16 .cse26 .cse17 .cse24 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19)))) [2021-11-07 01:04:58,061 INFO L853 garLoopResultBuilder]: At program point L276-2(lines 264 278) the Hoare annotation is: (let ((.cse6 (= ~t2_pc~0 1)) (.cse22 (+ ~local~0 1))) (let ((.cse3 (= 2 ~t2_st~0)) (.cse20 (<= ~token~0 .cse22)) (.cse5 (= 0 ~t3_pc~0)) (.cse21 (<= .cse22 ~token~0)) (.cse13 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse15 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (= ~E_3~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse16 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (not (= ~t1_st~0 0))) (.cse18 (= 0 ~t2_st~0)) (.cse19 (not .cse6)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ~E_1~0 2)) (.cse17 (= ~t3_pc~0 1)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse18 .cse19 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse20 .cse4 .cse6 .cse7 .cse8 .cse21 .cse9 .cse16 .cse10 .cse18 .cse11 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse20 .cse4 (not .cse14) .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse7 .cse8 .cse9 .cse16 .cse10 .cse18 .cse19 .cse11 .cse12 .cse17 .cse14)))) [2021-11-07 01:04:58,062 INFO L853 garLoopResultBuilder]: At program point L276-3(lines 264 278) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2)) (.cse12 (= 0 ~t3_st~0)) (.cse13 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~t3_pc~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= 2 ~t3_st~0) .cse1 .cse2 .cse3 (not (= ~E_3~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse3 (let ((.cse16 (+ 2 ~local~0))) (let ((.cse14 (<= .cse16 ~token~0)) (.cse15 (<= ~token~0 .cse16))) (or (and .cse0 .cse14 .cse15 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse13) (and .cse0 .cse14 .cse15 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))))))) [2021-11-07 01:04:58,062 INFO L853 garLoopResultBuilder]: At program point L276-4(lines 264 278) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (< 0 ~t3_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2)) (.cse11 (= ~t3_pc~0 1)) (.cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4)) .cse12))) [2021-11-07 01:04:58,062 INFO L853 garLoopResultBuilder]: At program point L276-5(lines 264 278) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1))) (let ((.cse16 (<= ~token~0 .cse23)) (.cse18 (<= .cse23 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (not .cse17)) (.cse15 (= 2 ~t3_st~0)) (.cse19 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse21 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse12 (= ~E_1~0 2)) (.cse13 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse10 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse14) (let ((.cse22 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse20 .cse14)) (and .cse0 .cse15 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse8 .cse19 .cse12 .cse20 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14)))) [2021-11-07 01:04:58,063 INFO L853 garLoopResultBuilder]: At program point L276-6(lines 264 278) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1))) (let ((.cse16 (<= ~token~0 .cse23)) (.cse18 (<= .cse23 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (not .cse17)) (.cse15 (= 2 ~t3_st~0)) (.cse19 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse21 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse12 (= ~E_1~0 2)) (.cse13 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse10 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse14) (let ((.cse22 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse20 .cse14)) (and .cse0 .cse15 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse8 .cse19 .cse12 .cse20 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14)))) [2021-11-07 01:04:58,063 INFO L853 garLoopResultBuilder]: At program point L147-1(lines 135 166) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0))) (let ((.cse6 (< 0 ~t2_st~0)) (.cse0 (= 2 ~t3_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse21 (= ~m_pc~0 1)) (.cse22 (not .cse3)) (.cse28 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~t3_pc~0 1)) (.cse16 (= ~t1_pc~0 1))) (let ((.cse4 (not .cse16)) (.cse5 (= ~t1_st~0 0)) (.cse8 (= ~E_3~0 ~E_1~0)) (.cse10 (= ~m_pc~0 0)) (.cse13 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse25 (let ((.cse30 (not (= ~E_3~0 1)))) (or (and .cse16 .cse0 .cse1 .cse6 .cse30 .cse21 .cse22 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse30 .cse21 .cse22 .cse28 .cse14 .cse15)))) (.cse2 (= ~T1_E~0 2)) (.cse29 (= ~E_1~0 ~t1_st~0)) (.cse19 (= ~E_3~0 2)) (.cse20 (= 0 ~t3_pc~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~E_2~0 2)) (.cse27 (= ~m_st~0 ~E_1~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse23 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse24 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse7 .cse9 .cse22 .cse23 .cse14 .cse24) (and .cse19 .cse5 .cse9 .cse25 .cse11 .cse12 .cse23) (let ((.cse26 (+ 2 ~local~0))) (and .cse16 .cse17 (<= .cse26 ~token~0) (<= ~token~0 .cse26) .cse1 .cse18 .cse19 .cse21 .cse9 .cse22 .cse23 .cse14 .cse24 .cse15)) (and .cse1 .cse2 .cse19 .cse20 .cse5 .cse6 .cse21 .cse7 .cse9 .cse27 .cse11 .cse12 .cse23 .cse14 .cse24) (and .cse0 .cse1 .cse2 .cse19 .cse5 .cse6 .cse21 .cse7 .cse9 .cse27 .cse11 .cse12 .cse23 .cse14 .cse15) (and .cse16 .cse1 .cse19 .cse20 .cse5 .cse21 .cse7 .cse9 .cse22 .cse11 .cse12 .cse23 .cse14 .cse24) (and .cse18 .cse19 (or (and .cse16 .cse0 .cse1 .cse3 .cse6 .cse7 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse3 .cse7 .cse28 .cse14 .cse15)) .cse9 .cse10 .cse13) (and .cse16 .cse1 .cse3 .cse18 .cse19 .cse20 .cse7 .cse9 .cse10 .cse13 .cse14 .cse24) (and .cse16 .cse0 .cse1 .cse2 .cse29 .cse19 .cse6 .cse21 .cse7 .cse9 .cse27 .cse11 .cse12 .cse23 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24) (and .cse17 .cse18 .cse19 .cse9 .cse25 .cse23) (and .cse16 .cse1 .cse2 .cse29 .cse19 .cse20 .cse6 .cse21 .cse7 .cse9 .cse27 .cse11 .cse12 .cse23 .cse14 .cse24))))) [2021-11-07 01:04:58,064 INFO L853 garLoopResultBuilder]: At program point L81(lines 55 94) the Hoare annotation is: (let ((.cse6 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse1 (= 2 ~t3_st~0)) (.cse12 (= ~t3_pc~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse2 (<= 2 ~E_M~0)) (.cse13 (= ~T1_E~0 2)) (.cse14 (not .cse0)) (.cse21 (= 0 ~t3_pc~0)) (.cse15 (= ~t1_st~0 0)) (.cse16 (= ~E_3~0 ~E_1~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (not .cse6)) (.cse10 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse11 (= ~E_1~0 2)) (.cse22 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse13 .cse3 .cse14 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse13 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9 .cse19 .cse17 .cse18 .cse20 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) .cse7 .cse8 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse11 .cse12 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12) (and .cse2 .cse13 .cse3 .cse14 .cse21 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse22) (and .cse0 .cse2 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse22) (and .cse2 .cse13 .cse14 .cse21 .cse15 .cse16 .cse7 .cse8 .cse9 .cse19 .cse17 .cse18 .cse20 .cse10 .cse11 .cse22)))) [2021-11-07 01:04:58,064 INFO L853 garLoopResultBuilder]: At program point L678-1(lines 473 715) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 0)) (.cse17 (= ~t2_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse16 (<= ~token~0 .cse24)) (.cse18 (<= .cse24 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (not .cse17)) (.cse15 (= 2 ~t3_st~0)) (.cse19 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse22 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not .cse21)) (.cse12 (= ~E_1~0 2)) (.cse13 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse10 .cse12 .cse20) (and .cse1 .cse2 (= ~T1_E~0 2) .cse21 (not .cse0) .cse5 (= ~t1_st~0 0) .cse7 (= ~E_3~0 ~E_1~0) .cse8 (= ~m_pc~0 0) .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse22 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse14) (let ((.cse23 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse23 ~token~0) (<= ~token~0 .cse23) .cse2 .cse22 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse20 .cse14)) (and .cse0 .cse15 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse22 .cse3 .cse4 .cse17 .cse6 .cse8 .cse19 .cse12 .cse20 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14)))) [2021-11-07 01:04:58,064 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-07 01:04:58,064 INFO L857 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-11-07 01:04:58,065 INFO L853 garLoopResultBuilder]: At program point L219(lines 207 221) the Hoare annotation is: (and (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (not (= ~t1_pc~0 1)) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0)) [2021-11-07 01:04:58,065 INFO L853 garLoopResultBuilder]: At program point L219-1(lines 207 221) the Hoare annotation is: (let ((.cse23 (= ~t2_pc~0 1)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse0 (= 2 ~t3_st~0)) (.cse18 (= 2 ~t1_st~0)) (.cse21 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse16 (= ~t3_pc~0 1)) (.cse22 (= 2 ~t2_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~E_1~0 1)) (.cse4 (not .cse17)) (.cse5 (= ~E_3~0 2)) (.cse19 (= 0 ~t3_pc~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ~m_pc~0 0)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (not .cse23)) (.cse15 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse20 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse1 .cse3 .cse18 .cse5 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20) (and .cse17 .cse0 .cse1 .cse3 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse16) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16) (and .cse17 .cse1 .cse22 .cse3 .cse18 .cse5 .cse19 .cse23 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse20) (and .cse17 .cse0 .cse1 .cse22 .cse3 .cse18 .cse5 .cse23 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21 .cse16) (and .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse19 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20)))) [2021-11-07 01:04:58,065 INFO L853 garLoopResultBuilder]: At program point L219-2(lines 207 221) the Hoare annotation is: (let ((.cse19 (+ ~local~0 1)) (.cse17 (= ~t2_pc~0 1))) (let ((.cse8 (= 0 ~t2_st~0)) (.cse9 (not .cse17)) (.cse13 (= 0 ~t3_pc~0)) (.cse14 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse15 (= 2 ~t2_st~0)) (.cse16 (<= ~token~0 .cse19)) (.cse3 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse18 (<= .cse19 ~token~0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~t1_st~0 0))) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14) (and .cse0 .cse2 .cse15 .cse16 .cse3 .cse13 .cse17 .cse4 .cse5 .cse18 .cse6 .cse7 .cse10 .cse11 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse3 .cse17 .cse4 .cse5 .cse18 .cse6 .cse7 .cse10 .cse11 .cse12)))) [2021-11-07 01:04:58,066 INFO L853 garLoopResultBuilder]: At program point L219-3(lines 207 221) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (< 0 ~t2_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~E_2~0 2)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2))) (or (let ((.cse2 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse2 ~token~0) (<= ~token~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~t3_pc~0 1))) (and .cse0 .cse1 .cse3 .cse4 (= 0 ~t3_pc~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t3_st~0)))) [2021-11-07 01:04:58,066 INFO L853 garLoopResultBuilder]: At program point L219-4(lines 207 221) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (< 0 ~t3_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-11-07 01:04:58,066 INFO L853 garLoopResultBuilder]: At program point L219-5(lines 207 221) the Hoare annotation is: (let ((.cse18 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1))) (let ((.cse3 (<= ~token~0 .cse23)) (.cse9 (<= .cse23 ~token~0)) (.cse12 (= 0 ~t2_st~0)) (.cse15 (not .cse18)) (.cse16 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_M~0)) (.cse17 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= 0 ~t3_pc~0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse20 (<= ~token~0 ~local~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse13 .cse14) (and .cse0 .cse16 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse17 .cse4 .cse5 .cse18 .cse7 .cse10 .cse13 .cse19 (< ~token~0 (+ ~local~0 4)) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (and .cse0 .cse16 .cse2 .cse17 .cse4 .cse5 .cse18 .cse7 .cse8 .cse10 .cse11 .cse20 .cse21 .cse13 .cse19) (let ((.cse22 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse2 .cse17 .cse4 .cse5 .cse18 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse19)) (and .cse0 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse13 .cse19) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse16 .cse1 .cse2 .cse17 .cse4 .cse5 .cse18 .cse7 .cse8 .cse10 .cse11 .cse13 .cse19) (and .cse0 .cse2 .cse17 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse20 .cse21 .cse13 .cse14)))) [2021-11-07 01:04:58,067 INFO L853 garLoopResultBuilder]: At program point L219-6(lines 207 221) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1))) (let ((.cse16 (<= ~token~0 .cse23)) (.cse18 (<= .cse23 ~token~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (not .cse17)) (.cse15 (= 2 ~t3_st~0)) (.cse19 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse20 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse21 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse12 (= ~E_1~0 2)) (.cse13 (= 0 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse19 .cse10 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse14) (let ((.cse22 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse22 ~token~0) (<= ~token~0 .cse22) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse20 .cse14)) (and .cse0 .cse15 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse21 .cse3 .cse4 .cse17 .cse6 .cse8 .cse19 .cse12 .cse20 (< ~token~0 (+ ~local~0 4)) .cse14) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14)))) [2021-11-07 01:04:58,067 INFO L853 garLoopResultBuilder]: At program point L419(lines 346 424) the Hoare annotation is: (let ((.cse23 (+ ~local~0 1)) (.cse17 (= ~t2_pc~0 1))) (let ((.cse19 (not .cse17)) (.cse16 (= 2 ~t2_st~0)) (.cse6 (= 0 ~t3_pc~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (<= ~token~0 ~local~0)) (.cse22 (<= ~local~0 ~token~0)) (.cse14 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= ~token~0 .cse23)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse9 (<= .cse23 ~token~0)) (.cse10 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (= 0 ~t2_st~0)) (.cse13 (= ~E_1~0 2)) (.cse18 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse2 .cse16 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse13 .cse14 .cse18)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14) (and .cse0 .cse20 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse16 .cse4 .cse5 .cse17 .cse7 .cse10 .cse13 .cse18 (< ~token~0 (+ ~local~0 4)) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse0 .cse20 .cse1 .cse2 .cse4 .cse5 .cse7 .cse10 .cse11 .cse12 .cse19 .cse13 .cse18) (and .cse0 .cse20 .cse1 .cse2 .cse16 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse13 .cse18) (and .cse0 .cse20 .cse2 .cse16 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse21 .cse22 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse2 .cse16 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11 .cse21 .cse22 .cse13 .cse14) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18)))) [2021-11-07 01:04:58,067 INFO L857 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2021-11-07 01:04:58,068 INFO L857 garLoopResultBuilder]: For program point L357-1(lines 352 418) no Hoare annotation was computed. [2021-11-07 01:04:58,068 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,068 INFO L857 garLoopResultBuilder]: For program point L227-2(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,068 INFO L857 garLoopResultBuilder]: For program point L227-3(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,068 INFO L857 garLoopResultBuilder]: For program point L227-5(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,069 INFO L857 garLoopResultBuilder]: For program point L227-6(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,069 INFO L857 garLoopResultBuilder]: For program point L227-8(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,069 INFO L857 garLoopResultBuilder]: For program point L227-9(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,069 INFO L857 garLoopResultBuilder]: For program point L227-11(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,069 INFO L857 garLoopResultBuilder]: For program point L227-12(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,069 INFO L857 garLoopResultBuilder]: For program point L227-14(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,070 INFO L857 garLoopResultBuilder]: For program point L227-15(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,070 INFO L857 garLoopResultBuilder]: For program point L227-17(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,070 INFO L857 garLoopResultBuilder]: For program point L227-18(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,070 INFO L857 garLoopResultBuilder]: For program point L227-20(lines 227 236) no Hoare annotation was computed. [2021-11-07 01:04:58,070 INFO L857 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2021-11-07 01:04:58,070 INFO L857 garLoopResultBuilder]: For program point L228-1(lines 228 233) no Hoare annotation was computed. [2021-11-07 01:04:58,071 INFO L857 garLoopResultBuilder]: For program point L228-2(lines 228 233) no Hoare annotation was computed. [2021-11-07 01:04:58,071 INFO L857 garLoopResultBuilder]: For program point L228-3(lines 228 233) no Hoare annotation was computed. [2021-11-07 01:04:58,071 INFO L857 garLoopResultBuilder]: For program point L228-4(lines 228 233) no Hoare annotation was computed. [2021-11-07 01:04:58,071 INFO L857 garLoopResultBuilder]: For program point L228-5(lines 228 233) no Hoare annotation was computed. [2021-11-07 01:04:58,071 INFO L857 garLoopResultBuilder]: For program point L228-6(lines 228 233) no Hoare annotation was computed. [2021-11-07 01:04:58,072 INFO L853 garLoopResultBuilder]: At program point L362(lines 352 418) the Hoare annotation is: (let ((.cse20 (= ~t2_pc~0 1)) (.cse24 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse35 (+ ~local~0 1))) (let ((.cse18 (= ~E_1~0 ~t1_st~0)) (.cse32 (<= ~token~0 .cse35)) (.cse33 (<= .cse35 ~token~0)) (.cse34 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 1)) (.cse9 (= ~m_st~0 ~E_1~0)) (.cse3 (= ~T1_E~0 2)) (.cse30 (not .cse0)) (.cse23 (= ~t1_st~0 0)) (.cse31 (= ~E_3~0 ~E_1~0)) (.cse25 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse14 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse17 (= 2 ~t2_st~0)) (.cse29 (not (= ~E_3~0 1))) (.cse16 (= ~t3_pc~0 1)) (.cse26 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse19 (= 0 ~t3_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse28 (not .cse24)) (.cse10 (= 0 ~t2_st~0)) (.cse13 (not .cse20)) (.cse21 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse15 (= ~E_1~0 2)) (.cse22 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse17 .cse18 .cse5 .cse19 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 .cse15 .cse22) (and .cse2 .cse3 .cse17 .cse5 .cse19 .cse23 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse18 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse24 .cse4 .cse5 .cse20 .cse7 .cse8 .cse25 .cse14 .cse15 .cse16) (let ((.cse27 (+ 2 ~local~0))) (and .cse0 .cse26 (<= .cse27 ~token~0) (<= ~token~0 .cse27) .cse2 .cse17 .cse4 .cse5 .cse20 .cse6 .cse8 .cse28 .cse21 .cse15 .cse22 .cse16)) (and .cse0 .cse1 .cse26 .cse2 .cse4 .cse5 .cse29 .cse6 .cse8 .cse28 .cse10 .cse13 .cse21 .cse15 .cse16) (and .cse0 .cse2 .cse17 .cse24 .cse4 .cse5 .cse19 .cse20 .cse7 .cse8 .cse25 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse24 .cse4 .cse5 .cse7 .cse8 .cse25 .cse10 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse17 .cse24 .cse30 .cse19 .cse23 .cse20 .cse7 .cse31 .cse8 .cse25 .cse11 .cse12 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse26 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse17 .cse4 .cse5 .cse20 .cse6 .cse8 .cse21 .cse15 .cse16 (< ~token~0 (+ ~local~0 4))) (and .cse1 .cse2 .cse3 .cse17 .cse24 .cse30 .cse23 .cse20 .cse7 .cse31 .cse8 .cse25 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse24 .cse4 .cse5 .cse19 .cse7 .cse8 .cse25 .cse10 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse26 .cse2 .cse32 .cse4 .cse5 .cse19 .cse6 .cse7 .cse33 .cse8 .cse28 .cse10 .cse21 .cse15 .cse22) (and .cse0 .cse1 .cse26 .cse2 .cse32 .cse4 .cse5 .cse29 .cse6 .cse33 .cse8 .cse28 .cse10 .cse21 .cse15 .cse16) (and .cse5 .cse19 (or (and .cse0 .cse2 .cse23 .cse6 .cse7 .cse8 .cse28 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse23 .cse6 .cse7 .cse8 .cse28 .cse34 .cse13 .cse15)) .cse10 .cse11 .cse12 .cse21 .cse22) (and .cse5 .cse8 (or (and .cse0 .cse1 .cse2 .cse23 .cse29 .cse6 .cse28 .cse34 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse23 .cse6 .cse28 .cse13 .cse14 .cse15 .cse16)) .cse10 .cse11 .cse12 .cse21) (and .cse2 .cse3 .cse5 .cse19 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (and .cse2 .cse3 .cse24 .cse30 .cse19 .cse23 .cse7 .cse31 .cse8 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (and .cse1 .cse2 .cse3 .cse17 .cse5 .cse23 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse5 .cse11 .cse12 .cse21 (or (and .cse0 .cse1 .cse2 .cse17 .cse23 .cse29 .cse20 .cse6 .cse8 .cse28 .cse34 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse23 .cse20 .cse6 .cse8 .cse28 .cse14 .cse15 .cse16))) (and .cse0 .cse26 .cse2 .cse17 .cse4 .cse5 .cse19 .cse29 .cse20 .cse6 .cse7 .cse8 .cse28 .cse21 .cse15 .cse22) (and (or (and .cse0 .cse2 .cse17 .cse23 .cse20 .cse6 .cse7 .cse8 .cse28 .cse14 .cse15) (and .cse0 .cse2 .cse17 .cse23 .cse29 .cse20 .cse6 .cse7 .cse8 .cse28 .cse34 .cse15)) .cse5 .cse19 .cse11 .cse12 .cse21 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (and .cse1 .cse2 .cse3 .cse24 .cse30 .cse23 .cse7 .cse31 .cse8 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse26 .cse2 .cse17 .cse4 .cse5 .cse29 .cse20 .cse6 .cse8 .cse28 .cse21 .cse15 .cse16) (and .cse0 .cse26 .cse2 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse28 .cse10 .cse13 .cse21 .cse15 .cse22)))) [2021-11-07 01:04:58,072 INFO L857 garLoopResultBuilder]: For program point L100(lines 100 108) no Hoare annotation was computed. [2021-11-07 01:04:58,072 INFO L857 garLoopResultBuilder]: For program point L365(lines 365 372) no Hoare annotation was computed. [2021-11-07 01:04:58,076 INFO L731 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, 1, 1, 1, 1, 1, 1] [2021-11-07 01:04:58,078 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:04:58,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:04:58 BoogieIcfgContainer [2021-11-07 01:04:58,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:04:58,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:04:58,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:04:58,260 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:04:58,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:31" (3/4) ... [2021-11-07 01:04:58,264 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 01:04:58,301 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 140 nodes and edges [2021-11-07 01:04:58,304 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-11-07 01:04:58,307 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-07 01:04:58,309 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:04:58,580 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:04:58,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:04:58,582 INFO L168 Benchmark]: Toolchain (without parser) took 90051.37 ms. Allocated memory was 86.0 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 61.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 253.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:58,590 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 86.0 MB. Free memory was 59.5 MB in the beginning and 59.4 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:04:58,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.88 ms. Allocated memory is still 86.0 MB. Free memory was 61.2 MB in the beginning and 57.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:58,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.16 ms. Allocated memory is still 86.0 MB. Free memory was 57.7 MB in the beginning and 53.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:58,592 INFO L168 Benchmark]: Boogie Preprocessor took 124.11 ms. Allocated memory is still 86.0 MB. Free memory was 53.9 MB in the beginning and 50.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:58,592 INFO L168 Benchmark]: RCFGBuilder took 2495.46 ms. Allocated memory was 86.0 MB in the beginning and 109.1 MB in the end (delta: 23.1 MB). Free memory was 50.8 MB in the beginning and 61.5 MB in the end (delta: -10.7 MB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:58,593 INFO L168 Benchmark]: TraceAbstraction took 86499.40 ms. Allocated memory was 109.1 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 61.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-11-07 01:04:58,593 INFO L168 Benchmark]: Witness Printer took 320.91 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:04:58,602 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.31 ms. Allocated memory is still 86.0 MB. Free memory was 59.5 MB in the beginning and 59.4 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 509.88 ms. Allocated memory is still 86.0 MB. Free memory was 61.2 MB in the beginning and 57.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 92.16 ms. Allocated memory is still 86.0 MB. Free memory was 57.7 MB in the beginning and 53.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 124.11 ms. Allocated memory is still 86.0 MB. Free memory was 53.9 MB in the beginning and 50.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2495.46 ms. Allocated memory was 86.0 MB in the beginning and 109.1 MB in the end (delta: 23.1 MB). Free memory was 50.8 MB in the beginning and 61.5 MB in the end (delta: -10.7 MB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 86499.40 ms. Allocated memory was 109.1 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 61.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. * Witness Printer took 320.91 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * 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, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 86.2s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 8361 SDtfs, 8829 SDslu, 11855 SDs, 0 SdLazy, 1850 SolverSat, 381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1811 GetRequests, 1679 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7077occurred in iteration=17, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 19516 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 530 NumberOfFragments, 18922 HoareAnnotationTreeSize, 46 FomulaSimplifications, 2132445 FormulaSimplificationTreeSizeReduction, 7.6s HoareSimplificationTime, 46 FomulaSimplificationsInter, 245142 FormulaSimplificationTreeSizeReductionInter, 37.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 3436 NumberOfCodeBlocks, 3436 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4205 ConstructedInterpolants, 0 QuantifiedInterpolants, 9348 SizeOfPredicates, 25 NumberOfNonLiveVariables, 3775 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 51 InterpolantComputations, 41 PerfectInterpolantSequences, 1074/1101 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: 264]: Loop Invariant Derived loop invariant: ((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && m_pc == t2_pc) && t1_st == 0) && __retres1 == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && !(t1_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && E_3 == 2) && !(__retres1 == 0)) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && E_1 == 1) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && token <= local) && __retres1 == 1) && local <= token) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 <= E_M) && E_1 == 1) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && __retres1 == 1) && local <= token) && !(t2_pc == 1)) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_1 == 1) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && 0 == t2_st) && token <= local) && __retres1 == 1) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_1 == 1) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && __retres1 == 1) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && T1_E == 2) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && 0 == t3_pc) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) || (((((((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && E_1 == 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && __retres1 == 1) && local <= token) && !(t2_pc == 1)) && tmp == 1) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && E_1 == 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && __retres1 == 1) && local <= token) && !(tmp == 0)) && t3_pc == 1)) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_1 == 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && __retres1 == 1) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && T1_E == 2) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && t3_pc == 1)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_1 == 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && __retres1 == 1) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && t3_pc == 1)) || (((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && 0 == t3_st) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && E_1 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_3 == 2) && t1_st == 0) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 <= E_M && T1_E == 2) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((2 <= E_M && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && E_3 == 2) && !(__retres1 == 0)) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && token <= local + 1) && E_3 == 2) && !(__retres1 == 0)) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && token <= local + 1) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0)) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) || ((((((((((((((__retres1 == 0 && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((((__retres1 == 0 && 2 <= E_M) && token <= local + 1) && E_3 == 2) && !(__retres1 == 0)) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((2 <= E_M && m_st == 0) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((2 == t3_st && 2 <= E_M) && 2 == t2_st) && m_st == 0) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && E_3 == 2) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((2 == t3_st && 2 <= E_M) && m_st == 0) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 <= E_M && T1_E == 2) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((2 <= E_M && 2 == t2_st) && m_st == 0) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && 0 == t3_pc) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && E_1 == 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_1 == 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && t3_pc == 1)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_1 == 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && E_1 == 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1)) || ((((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || ((((((((((((((((2 <= E_M && T1_E == 2) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && 0 == t3_st) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 <= E_M && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && E_1 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_3 == 2) && t1_st == 0) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && E_1 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 <= E_M && T1_E == 2) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) || ((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 <= E_M && T1_E == 2) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((2 <= E_M && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && 0 == t3_pc) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((__retres1 == 0 && 2 == t1_st) && ((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1))) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == t1_st) && 0 < t3_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2)) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && token < local + 4) && __retres1 == 0)) || (((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && 0 < t3_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((((2 <= E_M && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((((2 <= E_M && T1_E == 2) && 0 < t3_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 <= E_M && T1_E == 2) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_1 == 1) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && __retres1 == 1) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0) || ((((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && E_1 == 1) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && __retres1 == 1) && local <= token) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 <= E_M) && E_1 == 1) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && __retres1 == 1) && local <= token) && !(t2_pc == 1)) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_1 == 1) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && __retres1 == 1) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && T1_E == 2) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((((2 == t3_st && __retres1 == 0) && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && m_pc == t2_pc) && t1_st == 0) && __retres1 == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && E_1 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_3 == 2) && t1_st == 0) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 <= E_M && T1_E == 2) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((2 <= E_M && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_1 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((2 <= E_M && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((E_3 == 2 && 0 == t3_pc) && ((((((((((t1_pc == 1 && 2 <= E_M) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) || (((((((((t1_pc == 1 && 2 <= E_M) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 1) && !(t2_pc == 1)) && E_1 == 2))) && 0 == t2_st) && token <= local) && local <= token) && !(tmp == 0)) && 0 == t3_st)) || ((((((E_3 == 2 && E_2 == 2) && (((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && t1_st == 0) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 1) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) || (((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && t1_st == 0) && m_pc == 1) && !(m_st == 0)) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1))) && 0 == t2_st) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((((((2 <= E_M && T1_E == 2) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((2 <= E_M && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((E_3 == 2 && token <= local) && local <= token) && !(tmp == 0)) && (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && t1_st == 0) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && __retres1 == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && tmp == 1) && E_1 == 2) && t3_pc == 1)))) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && tmp == 1) && E_1 == 2) || (((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && t1_st == 0) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 1) && E_1 == 2)) && E_3 == 2) && 0 == t3_pc) && token <= local) && local <= token) && !(tmp == 0)) && 0 == t3_st)) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && m_pc == t2_pc) && t1_st == 0) && __retres1 == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((E_3 == 2 && t1_st == 0) && E_2 == 2) && (((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 0 < t2_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1))) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((2 <= E_M && T1_E == 2) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((2 == t1_st && E_3 == 2) && ((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && m_st == 0) && 0 < t2_st) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) || (((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && m_st == 0) && __retres1 == 0) && __retres1 == 0) && E_1 == 2) && t3_pc == 1))) && E_2 == 2) && m_pc == 0) && tmp == 1)) || (((((((((((t1_pc == 1 && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && E_1 == t1_st) && E_3 == 2) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 <= E_M && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && 0 < t2_st) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((__retres1 == 0 && 2 == t1_st) && E_3 == 2) && E_2 == 2) && (((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 0 < t2_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1))) && !(tmp == 0))) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && E_1 == t1_st) && E_3 == 2) && 0 == t3_pc) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= E_M && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && m_pc == t2_pc) && t1_st == 0) && __retres1 == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && T1_E == 2) && 2 == t1_st) && E_3 == 2) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((2 <= E_M && T1_E == 2) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((t1_pc == 1 && 2 <= E_M) && T1_E == 2) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 < t2_st) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((2 == t3_st && 2 <= E_M) && T1_E == 2) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 < t2_st) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 <= E_M) && !(t3_pc == 1)) && m_st == 0) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && 0 < t2_st) && __retres1 == 0) && E_2 == 2) && m_pc == 0) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 < t2_st) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((((2 <= E_M && T1_E == 2) && !(t3_pc == 1)) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && 0 < t2_st) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_M) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 <= E_M) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 <= E_M) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((((__retres1 == 0 && 2 <= E_M) && T1_E == 2) && m_st == 0) && !(t1_pc == 1)) && 0 == t3_pc) && t1_st == 0) && __retres1 == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && 0 == t2_st) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 <= E_M) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && 0 == t3_pc) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) RESULT: Ultimate proved your program to be correct! [2021-11-07 01:04:58,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa43a87-ae8d-4ed3-b518-108adb65412d/bin/utaipan-UUZaoUuFF8/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