./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI --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 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:36:42,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:36:42,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:36:42,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:36:42,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:36:42,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:36:42,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:36:42,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:36:42,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:36:42,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:36:42,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:36:42,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:36:42,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:36:42,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:36:42,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:36:42,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:36:42,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:36:42,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:36:42,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:36:42,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:36:42,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:36:42,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:36:42,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:36:42,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:36:42,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:36:42,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:36:42,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:36:42,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:36:42,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:36:42,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:36:42,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:36:42,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:36:42,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:36:42,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:36:42,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:36:42,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:36:42,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:36:42,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:36:42,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:36:42,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:36:42,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:36:42,330 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:36:42,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:36:42,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:36:42,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:36:42,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:36:42,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:36:42,355 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:36:42,355 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:36:42,355 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:36:42,356 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:36:42,356 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:36:42,356 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:36:42,356 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:36:42,356 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:36:42,357 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:36:42,357 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:36:42,357 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:36:42,357 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:36:42,358 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:36:42,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:36:42,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:36:42,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:36:42,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:36:42,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:36:42,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:36:42,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:36:42,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:36:42,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:36:42,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:36:42,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:36:42,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:36:42,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:36:42,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:36:42,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:36:42,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:36:42,362 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:36:42,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:36:42,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:36:42,362 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:36:42,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:36:42,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:36:42,363 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:36:42,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/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_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2022-11-03 01:36:42,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:36:42,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:36:42,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:36:42,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:36:42,656 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:36:42,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-11-03 01:36:42,739 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/data/bc16be445/227e750b849248c59eb7da61d0067815/FLAGbd92fe145 [2022-11-03 01:36:43,353 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:36:43,353 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-11-03 01:36:43,367 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/data/bc16be445/227e750b849248c59eb7da61d0067815/FLAGbd92fe145 [2022-11-03 01:36:43,669 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/data/bc16be445/227e750b849248c59eb7da61d0067815 [2022-11-03 01:36:43,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:36:43,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:36:43,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:36:43,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:36:43,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:36:43,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400f51ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:43, skipping insertion in model container [2022-11-03 01:36:43,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:36:43" (1/1) ... [2022-11-03 01:36:43,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:36:43,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:36:44,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2022-11-03 01:36:44,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2022-11-03 01:36:44,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:36:44,197 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:36:44,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2022-11-03 01:36:44,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2022-11-03 01:36:44,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:36:44,298 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:36:44,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44 WrapperNode [2022-11-03 01:36:44,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:36:44,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:36:44,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:36:44,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:36:44,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,387 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2022-11-03 01:36:44,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:36:44,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:36:44,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:36:44,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:36:44,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,467 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:36:44,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:36:44,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:36:44,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:36:44,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:36:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:44,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:36:44,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:36:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:36:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 01:36:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 01:36:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-03 01:36:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-03 01:36:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-03 01:36:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-03 01:36:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-03 01:36:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-03 01:36:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-03 01:36:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-03 01:36:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-03 01:36:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-03 01:36:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-03 01:36:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-03 01:36:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-03 01:36:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-03 01:36:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-03 01:36:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-03 01:36:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-03 01:36:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-03 01:36:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-03 01:36:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-03 01:36:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:36:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-03 01:36:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-03 01:36:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-03 01:36:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-03 01:36:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:36:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:36:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-03 01:36:44,569 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-03 01:36:44,734 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:36:44,736 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:36:45,231 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-03 01:36:45,232 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-03 01:36:45,283 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:36:45,590 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:36:45,590 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-03 01:36:45,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:36:45 BoogieIcfgContainer [2022-11-03 01:36:45,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:36:45,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:36:45,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:36:45,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:36:45,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:36:43" (1/3) ... [2022-11-03 01:36:45,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fcc667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:36:45, skipping insertion in model container [2022-11-03 01:36:45,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (2/3) ... [2022-11-03 01:36:45,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fcc667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:36:45, skipping insertion in model container [2022-11-03 01:36:45,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:36:45" (3/3) ... [2022-11-03 01:36:45,606 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-11-03 01:36:45,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:36:45,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 01:36:45,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:36:45,711 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5df5c3a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:36:45,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 01:36:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 114 states have internal predecessors, (161), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-03 01:36:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 01:36:45,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:45,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:45,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:45,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1579192629, now seen corresponding path program 1 times [2022-11-03 01:36:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:45,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931242419] [2022-11-03 01:36:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:36:46,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:46,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931242419] [2022-11-03 01:36:46,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931242419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:46,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:46,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:36:46,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472964058] [2022-11-03 01:36:46,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:46,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:36:46,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:36:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:36:46,301 INFO L87 Difference]: Start difference. First operand has 157 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 114 states have internal predecessors, (161), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:36:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:47,251 INFO L93 Difference]: Finished difference Result 571 states and 847 transitions. [2022-11-03 01:36:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:36:47,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-11-03 01:36:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:47,279 INFO L225 Difference]: With dead ends: 571 [2022-11-03 01:36:47,279 INFO L226 Difference]: Without dead ends: 409 [2022-11-03 01:36:47,288 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:36:47,292 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 556 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:47,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 574 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:36:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-03 01:36:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 398. [2022-11-03 01:36:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 282 states have (on average 1.3865248226950355) internal successors, (391), 289 states have internal predecessors, (391), 77 states have call successors, (77), 38 states have call predecessors, (77), 37 states have return successors, (97), 72 states have call predecessors, (97), 75 states have call successors, (97) [2022-11-03 01:36:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 565 transitions. [2022-11-03 01:36:47,446 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 565 transitions. Word has length 37 [2022-11-03 01:36:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:47,447 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 565 transitions. [2022-11-03 01:36:47,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:36:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 565 transitions. [2022-11-03 01:36:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 01:36:47,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:47,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:47,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:36:47,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1155886822, now seen corresponding path program 1 times [2022-11-03 01:36:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:47,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674320016] [2022-11-03 01:36:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:47,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:36:47,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:47,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674320016] [2022-11-03 01:36:47,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674320016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:47,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:47,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:36:47,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060761981] [2022-11-03 01:36:47,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:47,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:36:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:47,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:36:47,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:36:47,599 INFO L87 Difference]: Start difference. First operand 398 states and 565 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 01:36:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:47,929 INFO L93 Difference]: Finished difference Result 598 states and 842 transitions. [2022-11-03 01:36:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:36:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2022-11-03 01:36:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:47,937 INFO L225 Difference]: With dead ends: 598 [2022-11-03 01:36:47,937 INFO L226 Difference]: Without dead ends: 527 [2022-11-03 01:36:47,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:36:47,943 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 269 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:47,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 419 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:36:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-03 01:36:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 516. [2022-11-03 01:36:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 366 states have (on average 1.3743169398907105) internal successors, (503), 373 states have internal predecessors, (503), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (120), 92 states have call predecessors, (120), 95 states have call successors, (120) [2022-11-03 01:36:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 720 transitions. [2022-11-03 01:36:48,011 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 720 transitions. Word has length 44 [2022-11-03 01:36:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:48,012 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 720 transitions. [2022-11-03 01:36:48,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 01:36:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 720 transitions. [2022-11-03 01:36:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:36:48,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:48,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:48,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:36:48,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 863856876, now seen corresponding path program 1 times [2022-11-03 01:36:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:48,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231467594] [2022-11-03 01:36:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:36:48,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:48,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231467594] [2022-11-03 01:36:48,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231467594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:48,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:48,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:36:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845749603] [2022-11-03 01:36:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:48,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:36:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:48,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:36:48,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:36:48,176 INFO L87 Difference]: Start difference. First operand 516 states and 720 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 01:36:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:48,985 INFO L93 Difference]: Finished difference Result 1053 states and 1443 transitions. [2022-11-03 01:36:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:36:48,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-11-03 01:36:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:48,993 INFO L225 Difference]: With dead ends: 1053 [2022-11-03 01:36:48,993 INFO L226 Difference]: Without dead ends: 587 [2022-11-03 01:36:48,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:36:49,002 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 654 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:49,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 791 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:36:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-03 01:36:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 502. [2022-11-03 01:36:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 352 states have (on average 1.3352272727272727) internal successors, (470), 359 states have internal predecessors, (470), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (117), 92 states have call predecessors, (117), 95 states have call successors, (117) [2022-11-03 01:36:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 684 transitions. [2022-11-03 01:36:49,094 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 684 transitions. Word has length 45 [2022-11-03 01:36:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:49,095 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 684 transitions. [2022-11-03 01:36:49,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 01:36:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 684 transitions. [2022-11-03 01:36:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 01:36:49,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:49,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:49,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:36:49,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:49,097 INFO L85 PathProgramCache]: Analyzing trace with hash 857725223, now seen corresponding path program 1 times [2022-11-03 01:36:49,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:49,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078202501] [2022-11-03 01:36:49,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:36:49,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:49,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078202501] [2022-11-03 01:36:49,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078202501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:49,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:49,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:36:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451050344] [2022-11-03 01:36:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:49,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:36:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:49,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:36:49,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:36:49,183 INFO L87 Difference]: Start difference. First operand 502 states and 684 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 01:36:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:49,921 INFO L93 Difference]: Finished difference Result 968 states and 1292 transitions. [2022-11-03 01:36:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:36:49,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2022-11-03 01:36:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:49,928 INFO L225 Difference]: With dead ends: 968 [2022-11-03 01:36:49,928 INFO L226 Difference]: Without dead ends: 791 [2022-11-03 01:36:49,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:36:49,939 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 568 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:49,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 734 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:36:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-03 01:36:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 766. [2022-11-03 01:36:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 533 states have (on average 1.2926829268292683) internal successors, (689), 540 states have internal predecessors, (689), 146 states have call successors, (146), 86 states have call predecessors, (146), 85 states have return successors, (183), 141 states have call predecessors, (183), 144 states have call successors, (183) [2022-11-03 01:36:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1018 transitions. [2022-11-03 01:36:50,056 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1018 transitions. Word has length 46 [2022-11-03 01:36:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:50,057 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1018 transitions. [2022-11-03 01:36:50,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 01:36:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1018 transitions. [2022-11-03 01:36:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 01:36:50,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:50,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:50,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:36:50,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:50,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash 63830602, now seen corresponding path program 1 times [2022-11-03 01:36:50,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:50,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481619397] [2022-11-03 01:36:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:36:50,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:50,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481619397] [2022-11-03 01:36:50,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481619397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:50,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:50,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:36:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954783024] [2022-11-03 01:36:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:50,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:50,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:50,140 INFO L87 Difference]: Start difference. First operand 766 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 01:36:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:50,250 INFO L93 Difference]: Finished difference Result 767 states and 1019 transitions. [2022-11-03 01:36:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-11-03 01:36:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:50,254 INFO L225 Difference]: With dead ends: 767 [2022-11-03 01:36:50,254 INFO L226 Difference]: Without dead ends: 323 [2022-11-03 01:36:50,255 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:36:50,256 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:50,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 158 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:36:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-03 01:36:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-03 01:36:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 231 states have (on average 1.3722943722943723) internal successors, (317), 235 states have internal predecessors, (317), 61 states have call successors, (61), 30 states have call predecessors, (61), 30 states have return successors, (83), 58 states have call predecessors, (83), 61 states have call successors, (83) [2022-11-03 01:36:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 461 transitions. [2022-11-03 01:36:50,302 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 461 transitions. Word has length 50 [2022-11-03 01:36:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:50,303 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 461 transitions. [2022-11-03 01:36:50,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 01:36:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 461 transitions. [2022-11-03 01:36:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-03 01:36:50,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:50,306 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:36:50,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:36:50,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash 50429275, now seen corresponding path program 1 times [2022-11-03 01:36:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503987194] [2022-11-03 01:36:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:50,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:36:50,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:50,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503987194] [2022-11-03 01:36:50,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503987194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:50,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:50,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:36:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500034224] [2022-11-03 01:36:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:50,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:36:50,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:50,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:36:50,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:36:50,655 INFO L87 Difference]: Start difference. First operand 323 states and 461 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:36:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:51,010 INFO L93 Difference]: Finished difference Result 846 states and 1232 transitions. [2022-11-03 01:36:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:36:51,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-11-03 01:36:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:51,014 INFO L225 Difference]: With dead ends: 846 [2022-11-03 01:36:51,014 INFO L226 Difference]: Without dead ends: 530 [2022-11-03 01:36:51,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:36:51,016 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 219 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:51,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 323 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:36:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-03 01:36:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 500. [2022-11-03 01:36:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 357 states have (on average 1.3529411764705883) internal successors, (483), 363 states have internal predecessors, (483), 94 states have call successors, (94), 48 states have call predecessors, (94), 48 states have return successors, (131), 89 states have call predecessors, (131), 94 states have call successors, (131) [2022-11-03 01:36:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 708 transitions. [2022-11-03 01:36:51,086 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 708 transitions. Word has length 66 [2022-11-03 01:36:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:51,087 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 708 transitions. [2022-11-03 01:36:51,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:36:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 708 transitions. [2022-11-03 01:36:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 01:36:51,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:51,089 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:36:51,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:36:51,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:51,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1020376246, now seen corresponding path program 1 times [2022-11-03 01:36:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:51,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029961447] [2022-11-03 01:36:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:36:51,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:51,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029961447] [2022-11-03 01:36:51,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029961447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:51,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:51,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:36:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347057503] [2022-11-03 01:36:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:51,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:36:51,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:36:51,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:36:51,398 INFO L87 Difference]: Start difference. First operand 500 states and 708 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:36:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:51,800 INFO L93 Difference]: Finished difference Result 1486 states and 2164 transitions. [2022-11-03 01:36:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:36:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2022-11-03 01:36:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:51,807 INFO L225 Difference]: With dead ends: 1486 [2022-11-03 01:36:51,807 INFO L226 Difference]: Without dead ends: 993 [2022-11-03 01:36:51,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:36:51,809 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 211 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:51,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 269 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:36:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-11-03 01:36:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 943. [2022-11-03 01:36:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 670 states have (on average 1.328358208955224) internal successors, (890), 681 states have internal predecessors, (890), 176 states have call successors, (176), 96 states have call predecessors, (176), 96 states have return successors, (243), 166 states have call predecessors, (243), 176 states have call successors, (243) [2022-11-03 01:36:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1309 transitions. [2022-11-03 01:36:51,951 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1309 transitions. Word has length 67 [2022-11-03 01:36:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:51,951 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1309 transitions. [2022-11-03 01:36:51,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:36:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1309 transitions. [2022-11-03 01:36:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-03 01:36:51,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:51,954 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:36:51,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:36:51,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash -182346185, now seen corresponding path program 1 times [2022-11-03 01:36:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:51,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086867402] [2022-11-03 01:36:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:36:52,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:52,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086867402] [2022-11-03 01:36:52,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086867402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:52,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:52,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:36:52,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811980921] [2022-11-03 01:36:52,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:52,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:52,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:52,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:52,064 INFO L87 Difference]: Start difference. First operand 943 states and 1309 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 01:36:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:52,252 INFO L93 Difference]: Finished difference Result 1958 states and 2750 transitions. [2022-11-03 01:36:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:52,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2022-11-03 01:36:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:52,260 INFO L225 Difference]: With dead ends: 1958 [2022-11-03 01:36:52,260 INFO L226 Difference]: Without dead ends: 1140 [2022-11-03 01:36:52,263 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:36:52,263 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 36 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:52,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 215 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:36:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-11-03 01:36:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1023. [2022-11-03 01:36:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 738 states have (on average 1.3414634146341464) internal successors, (990), 749 states have internal predecessors, (990), 182 states have call successors, (182), 102 states have call predecessors, (182), 102 states have return successors, (249), 172 states have call predecessors, (249), 182 states have call successors, (249) [2022-11-03 01:36:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1421 transitions. [2022-11-03 01:36:52,426 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1421 transitions. Word has length 68 [2022-11-03 01:36:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:52,426 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1421 transitions. [2022-11-03 01:36:52,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 01:36:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1421 transitions. [2022-11-03 01:36:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 01:36:52,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:52,431 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:52,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:36:52,431 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944015, now seen corresponding path program 1 times [2022-11-03 01:36:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:52,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819061693] [2022-11-03 01:36:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 01:36:52,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819061693] [2022-11-03 01:36:52,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819061693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:52,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:52,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:36:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19361360] [2022-11-03 01:36:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:52,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:52,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:52,494 INFO L87 Difference]: Start difference. First operand 1023 states and 1421 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 01:36:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:52,764 INFO L93 Difference]: Finished difference Result 2544 states and 3583 transitions. [2022-11-03 01:36:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 87 [2022-11-03 01:36:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:52,774 INFO L225 Difference]: With dead ends: 2544 [2022-11-03 01:36:52,775 INFO L226 Difference]: Without dead ends: 1527 [2022-11-03 01:36:52,778 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:36:52,779 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:52,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 179 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:36:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-11-03 01:36:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1514. [2022-11-03 01:36:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1093 states have (on average 1.3211344922232389) internal successors, (1444), 1109 states have internal predecessors, (1444), 267 states have call successors, (267), 153 states have call predecessors, (267), 153 states have return successors, (364), 252 states have call predecessors, (364), 267 states have call successors, (364) [2022-11-03 01:36:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2075 transitions. [2022-11-03 01:36:52,962 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2075 transitions. Word has length 87 [2022-11-03 01:36:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:52,962 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2075 transitions. [2022-11-03 01:36:52,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 01:36:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2075 transitions. [2022-11-03 01:36:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:36:52,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:52,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:36:52,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:36:52,969 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1507846843, now seen corresponding path program 1 times [2022-11-03 01:36:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:52,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813110477] [2022-11-03 01:36:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:52,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 01:36:53,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:53,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813110477] [2022-11-03 01:36:53,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813110477] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:36:53,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260185505] [2022-11-03 01:36:53,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:53,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:53,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:53,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:36:53,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:36:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:53,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:36:53,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:36:53,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:53,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260185505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:53,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:36:53,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:36:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378955721] [2022-11-03 01:36:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:53,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:36:53,294 INFO L87 Difference]: Start difference. First operand 1514 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:36:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:53,613 INFO L93 Difference]: Finished difference Result 2970 states and 4109 transitions. [2022-11-03 01:36:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:53,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-11-03 01:36:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:53,623 INFO L225 Difference]: With dead ends: 2970 [2022-11-03 01:36:53,623 INFO L226 Difference]: Without dead ends: 1855 [2022-11-03 01:36:53,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:36:53,628 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:53,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:36:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2022-11-03 01:36:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1799. [2022-11-03 01:36:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1340 states have (on average 1.3074626865671641) internal successors, (1752), 1353 states have internal predecessors, (1752), 273 states have call successors, (273), 183 states have call predecessors, (273), 185 states have return successors, (369), 263 states have call predecessors, (369), 273 states have call successors, (369) [2022-11-03 01:36:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2394 transitions. [2022-11-03 01:36:53,850 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2394 transitions. Word has length 101 [2022-11-03 01:36:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:53,850 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2394 transitions. [2022-11-03 01:36:53,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:36:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2394 transitions. [2022-11-03 01:36:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:36:53,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:53,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:53,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:36:54,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:54,073 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash -727865914, now seen corresponding path program 1 times [2022-11-03 01:36:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:54,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082757160] [2022-11-03 01:36:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-03 01:36:54,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:54,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082757160] [2022-11-03 01:36:54,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082757160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:36:54,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097736493] [2022-11-03 01:36:54,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:54,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:54,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:54,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:36:54,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:36:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:54,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:36:54,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 01:36:54,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:54,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097736493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:54,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:36:54,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:36:54,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089018129] [2022-11-03 01:36:54,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:54,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:54,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:54,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:36:54,403 INFO L87 Difference]: Start difference. First operand 1799 states and 2394 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:36:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:54,828 INFO L93 Difference]: Finished difference Result 3439 states and 4640 transitions. [2022-11-03 01:36:54,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:54,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-11-03 01:36:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:54,841 INFO L225 Difference]: With dead ends: 3439 [2022-11-03 01:36:54,844 INFO L226 Difference]: Without dead ends: 2223 [2022-11-03 01:36:54,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:36:54,849 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:54,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:36:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2022-11-03 01:36:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1928. [2022-11-03 01:36:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1460 states have internal predecessors, (1908), 284 states have call successors, (284), 194 states have call predecessors, (284), 196 states have return successors, (380), 274 states have call predecessors, (380), 284 states have call successors, (380) [2022-11-03 01:36:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2572 transitions. [2022-11-03 01:36:55,118 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2572 transitions. Word has length 101 [2022-11-03 01:36:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:55,119 INFO L495 AbstractCegarLoop]: Abstraction has 1928 states and 2572 transitions. [2022-11-03 01:36:55,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:36:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2572 transitions. [2022-11-03 01:36:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:36:55,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:55,125 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:36:55,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 01:36:55,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 01:36:55,337 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1699267653, now seen corresponding path program 2 times [2022-11-03 01:36:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:55,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549993106] [2022-11-03 01:36:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-03 01:36:55,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:55,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549993106] [2022-11-03 01:36:55,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549993106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:36:55,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206040771] [2022-11-03 01:36:55,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:36:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:55,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:55,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:36:55,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:36:55,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:36:55,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:36:55,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:36:55,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 01:36:55,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:55,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206040771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:55,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:36:55,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-11-03 01:36:55,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798497017] [2022-11-03 01:36:55,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:55,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:36:55,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:36:55,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:36:55,820 INFO L87 Difference]: Start difference. First operand 1928 states and 2572 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 01:36:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:56,214 INFO L93 Difference]: Finished difference Result 3494 states and 4658 transitions. [2022-11-03 01:36:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:36:56,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-03 01:36:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:56,226 INFO L225 Difference]: With dead ends: 3494 [2022-11-03 01:36:56,226 INFO L226 Difference]: Without dead ends: 2082 [2022-11-03 01:36:56,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:36:56,232 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:56,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 370 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:36:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-11-03 01:36:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2013. [2022-11-03 01:36:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1507 states have (on average 1.3125414731254148) internal successors, (1978), 1526 states have internal predecessors, (1978), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-11-03 01:36:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2676 transitions. [2022-11-03 01:36:56,506 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2676 transitions. Word has length 101 [2022-11-03 01:36:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:56,506 INFO L495 AbstractCegarLoop]: Abstraction has 2013 states and 2676 transitions. [2022-11-03 01:36:56,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 01:36:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2676 transitions. [2022-11-03 01:36:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:36:56,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:56,512 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:56,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:36:56,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 01:36:56,726 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:56,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash 825789958, now seen corresponding path program 2 times [2022-11-03 01:36:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:56,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966637576] [2022-11-03 01:36:56,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:56,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 01:36:56,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:56,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966637576] [2022-11-03 01:36:56,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966637576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:36:56,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736708969] [2022-11-03 01:36:56,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:36:56,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:56,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:56,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:36:56,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:36:57,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:36:57,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:36:57,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:36:57,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 01:36:57,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:57,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736708969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:57,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:36:57,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:36:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858889348] [2022-11-03 01:36:57,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:57,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:36:57,085 INFO L87 Difference]: Start difference. First operand 2013 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:36:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:57,486 INFO L93 Difference]: Finished difference Result 3400 states and 4713 transitions. [2022-11-03 01:36:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:57,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-11-03 01:36:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:57,498 INFO L225 Difference]: With dead ends: 3400 [2022-11-03 01:36:57,498 INFO L226 Difference]: Without dead ends: 2023 [2022-11-03 01:36:57,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:36:57,504 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 82 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:57,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:36:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2022-11-03 01:36:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2007. [2022-11-03 01:36:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1501 states have (on average 1.2764823451032645) internal successors, (1916), 1520 states have internal predecessors, (1916), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-11-03 01:36:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2614 transitions. [2022-11-03 01:36:57,775 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2614 transitions. Word has length 101 [2022-11-03 01:36:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:57,776 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2614 transitions. [2022-11-03 01:36:57,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:36:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2614 transitions. [2022-11-03 01:36:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:36:57,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:57,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:36:57,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:36:57,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:57,997 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1974996728, now seen corresponding path program 1 times [2022-11-03 01:36:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:57,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651505622] [2022-11-03 01:36:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 01:36:58,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:58,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651505622] [2022-11-03 01:36:58,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651505622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:36:58,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31954875] [2022-11-03 01:36:58,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:58,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:58,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:58,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:36:58,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:36:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:58,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:36:58,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:36:58,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:58,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31954875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:58,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:36:58,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:36:58,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887055824] [2022-11-03 01:36:58,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:58,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:58,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:58,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:58,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:36:58,460 INFO L87 Difference]: Start difference. First operand 2007 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:36:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:58,770 INFO L93 Difference]: Finished difference Result 3862 states and 5182 transitions. [2022-11-03 01:36:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:58,771 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), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-11-03 01:36:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:58,783 INFO L225 Difference]: With dead ends: 3862 [2022-11-03 01:36:58,783 INFO L226 Difference]: Without dead ends: 2408 [2022-11-03 01:36:58,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:36:58,790 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 76 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:58,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 234 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:36:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2022-11-03 01:36:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2346. [2022-11-03 01:36:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 1766 states have (on average 1.2621744054360136) internal successors, (2229), 1788 states have internal predecessors, (2229), 335 states have call successors, (335), 232 states have call predecessors, (335), 244 states have return successors, (484), 326 states have call predecessors, (484), 335 states have call successors, (484) [2022-11-03 01:36:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3048 transitions. [2022-11-03 01:36:59,103 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3048 transitions. Word has length 101 [2022-11-03 01:36:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:59,103 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 3048 transitions. [2022-11-03 01:36:59,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:36:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3048 transitions. [2022-11-03 01:36:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 01:36:59,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:59,109 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:36:59,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:36:59,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:36:59,326 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:36:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash 151407579, now seen corresponding path program 1 times [2022-11-03 01:36:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:36:59,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320469741] [2022-11-03 01:36:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:59,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:36:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 01:36:59,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:36:59,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320469741] [2022-11-03 01:36:59,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320469741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:36:59,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518897892] [2022-11-03 01:36:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:59,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:36:59,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:59,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:36:59,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:36:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:59,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:36:59,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:36:59,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:59,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518897892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:59,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:36:59,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:36:59,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683774137] [2022-11-03 01:36:59,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:59,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:59,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:36:59,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:59,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:36:59,691 INFO L87 Difference]: Start difference. First operand 2346 states and 3048 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:37:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:00,109 INFO L93 Difference]: Finished difference Result 5495 states and 7182 transitions. [2022-11-03 01:37:00,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:37:00,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2022-11-03 01:37:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:00,126 INFO L225 Difference]: With dead ends: 5495 [2022-11-03 01:37:00,126 INFO L226 Difference]: Without dead ends: 3195 [2022-11-03 01:37:00,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:37:00,139 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 40 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:00,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:37:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2022-11-03 01:37:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2586. [2022-11-03 01:37:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 1964 states have (on average 1.269857433808554) internal successors, (2494), 1987 states have internal predecessors, (2494), 356 states have call successors, (356), 253 states have call predecessors, (356), 265 states have return successors, (505), 346 states have call predecessors, (505), 356 states have call successors, (505) [2022-11-03 01:37:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3355 transitions. [2022-11-03 01:37:00,561 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3355 transitions. Word has length 100 [2022-11-03 01:37:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:00,561 INFO L495 AbstractCegarLoop]: Abstraction has 2586 states and 3355 transitions. [2022-11-03 01:37:00,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:37:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3355 transitions. [2022-11-03 01:37:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:37:00,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:00,571 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:00,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 01:37:00,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 01:37:00,786 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2664700, now seen corresponding path program 1 times [2022-11-03 01:37:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:00,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487073370] [2022-11-03 01:37:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 01:37:01,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:01,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487073370] [2022-11-03 01:37:01,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487073370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:01,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487954486] [2022-11-03 01:37:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:01,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:01,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:01,299 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:01,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:37:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:01,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:37:01,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:37:01,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:01,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487954486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:01,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:37:01,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2022-11-03 01:37:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456042304] [2022-11-03 01:37:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:01,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:37:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:37:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:37:01,608 INFO L87 Difference]: Start difference. First operand 2586 states and 3355 transitions. Second operand has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 01:37:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:02,189 INFO L93 Difference]: Finished difference Result 4458 states and 5979 transitions. [2022-11-03 01:37:02,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:37:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-03 01:37:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:02,202 INFO L225 Difference]: With dead ends: 4458 [2022-11-03 01:37:02,202 INFO L226 Difference]: Without dead ends: 2687 [2022-11-03 01:37:02,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:37:02,207 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 110 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:02,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 188 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:37:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2022-11-03 01:37:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2671. [2022-11-03 01:37:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2039 states have (on average 1.2452182442373712) internal successors, (2539), 2062 states have internal predecessors, (2539), 358 states have call successors, (358), 261 states have call predecessors, (358), 273 states have return successors, (508), 348 states have call predecessors, (508), 358 states have call successors, (508) [2022-11-03 01:37:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3405 transitions. [2022-11-03 01:37:02,578 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3405 transitions. Word has length 101 [2022-11-03 01:37:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:02,579 INFO L495 AbstractCegarLoop]: Abstraction has 2671 states and 3405 transitions. [2022-11-03 01:37:02,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 01:37:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3405 transitions. [2022-11-03 01:37:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:37:02,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:02,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:02,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:02,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:02,802 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1547328139, now seen corresponding path program 1 times [2022-11-03 01:37:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:02,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920135856] [2022-11-03 01:37:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-03 01:37:02,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:02,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920135856] [2022-11-03 01:37:02,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920135856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:02,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832254467] [2022-11-03 01:37:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:02,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:02,904 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:02,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:37:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:03,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:37:03,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 01:37:03,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:03,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832254467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:03,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:37:03,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:37:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835279241] [2022-11-03 01:37:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:03,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:37:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:03,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:37:03,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:37:03,074 INFO L87 Difference]: Start difference. First operand 2671 states and 3405 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:37:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:03,467 INFO L93 Difference]: Finished difference Result 4281 states and 5436 transitions. [2022-11-03 01:37:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:37:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-11-03 01:37:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:03,510 INFO L225 Difference]: With dead ends: 4281 [2022-11-03 01:37:03,510 INFO L226 Difference]: Without dead ends: 3044 [2022-11-03 01:37:03,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:37:03,515 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 42 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:03,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:37:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-11-03 01:37:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2839. [2022-11-03 01:37:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2175 states have (on average 1.2501149425287357) internal successors, (2719), 2198 states have internal predecessors, (2719), 374 states have call successors, (374), 277 states have call predecessors, (374), 289 states have return successors, (524), 364 states have call predecessors, (524), 374 states have call successors, (524) [2022-11-03 01:37:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3617 transitions. [2022-11-03 01:37:03,901 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3617 transitions. Word has length 101 [2022-11-03 01:37:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:03,902 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 3617 transitions. [2022-11-03 01:37:03,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:37:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3617 transitions. [2022-11-03 01:37:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 01:37:03,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:03,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:03,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:04,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:37:04,125 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 644121779, now seen corresponding path program 1 times [2022-11-03 01:37:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140972903] [2022-11-03 01:37:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 01:37:04,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:04,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140972903] [2022-11-03 01:37:04,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140972903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:04,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336278002] [2022-11-03 01:37:04,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:04,267 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:04,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:37:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:04,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:37:04,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:37:04,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:04,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336278002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:04,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:37:04,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-03 01:37:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602455017] [2022-11-03 01:37:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:04,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:37:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:37:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:37:04,508 INFO L87 Difference]: Start difference. First operand 2839 states and 3617 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 01:37:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:05,145 INFO L93 Difference]: Finished difference Result 6355 states and 8113 transitions. [2022-11-03 01:37:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:37:05,146 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), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2022-11-03 01:37:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:05,164 INFO L225 Difference]: With dead ends: 6355 [2022-11-03 01:37:05,164 INFO L226 Difference]: Without dead ends: 3844 [2022-11-03 01:37:05,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:37:05,173 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 115 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:05,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 242 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:37:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2022-11-03 01:37:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3177. [2022-11-03 01:37:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 2485 states have (on average 1.2225352112676056) internal successors, (3038), 2507 states have internal predecessors, (3038), 373 states have call successors, (373), 305 states have call predecessors, (373), 318 states have return successors, (548), 365 states have call predecessors, (548), 373 states have call successors, (548) [2022-11-03 01:37:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 3959 transitions. [2022-11-03 01:37:05,690 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 3959 transitions. Word has length 102 [2022-11-03 01:37:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:05,691 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 3959 transitions. [2022-11-03 01:37:05,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 01:37:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 3959 transitions. [2022-11-03 01:37:05,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-03 01:37:05,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:05,698 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:37:05,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:05,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:37:05,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1683201521, now seen corresponding path program 1 times [2022-11-03 01:37:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:05,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714003521] [2022-11-03 01:37:05,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 01:37:06,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:06,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714003521] [2022-11-03 01:37:06,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714003521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:06,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:06,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:37:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229361477] [2022-11-03 01:37:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:06,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:37:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:37:06,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:37:06,093 INFO L87 Difference]: Start difference. First operand 3177 states and 3959 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:37:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:06,934 INFO L93 Difference]: Finished difference Result 7984 states and 9969 transitions. [2022-11-03 01:37:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:37:06,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2022-11-03 01:37:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:06,953 INFO L225 Difference]: With dead ends: 7984 [2022-11-03 01:37:06,953 INFO L226 Difference]: Without dead ends: 4156 [2022-11-03 01:37:06,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:37:06,963 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 76 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:06,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 344 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:37:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2022-11-03 01:37:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 4038. [2022-11-03 01:37:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4038 states, 3118 states have (on average 1.206863373957665) internal successors, (3763), 3143 states have internal predecessors, (3763), 503 states have call successors, (503), 407 states have call predecessors, (503), 416 states have return successors, (726), 488 states have call predecessors, (726), 503 states have call successors, (726) [2022-11-03 01:37:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 4992 transitions. [2022-11-03 01:37:07,526 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 4992 transitions. Word has length 103 [2022-11-03 01:37:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:07,526 INFO L495 AbstractCegarLoop]: Abstraction has 4038 states and 4992 transitions. [2022-11-03 01:37:07,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:37:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 4992 transitions. [2022-11-03 01:37:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-03 01:37:07,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:07,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:07,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 01:37:07,533 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1834855246, now seen corresponding path program 1 times [2022-11-03 01:37:07,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:07,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525516019] [2022-11-03 01:37:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 01:37:07,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:07,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525516019] [2022-11-03 01:37:07,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525516019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:07,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130251164] [2022-11-03 01:37:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:07,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:07,709 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:07,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:37:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:07,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 01:37:07,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:37:07,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:07,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130251164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:07,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:37:07,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 01:37:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555560687] [2022-11-03 01:37:07,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:07,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:37:07,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:07,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:37:07,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:37:07,929 INFO L87 Difference]: Start difference. First operand 4038 states and 4992 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 01:37:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:08,709 INFO L93 Difference]: Finished difference Result 6798 states and 8364 transitions. [2022-11-03 01:37:08,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:37:08,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 103 [2022-11-03 01:37:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:08,725 INFO L225 Difference]: With dead ends: 6798 [2022-11-03 01:37:08,726 INFO L226 Difference]: Without dead ends: 4019 [2022-11-03 01:37:08,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:37:08,733 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 160 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:08,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 357 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:37:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2022-11-03 01:37:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3803. [2022-11-03 01:37:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 2933 states have (on average 1.1868394135697238) internal successors, (3481), 2961 states have internal predecessors, (3481), 471 states have call successors, (471), 384 states have call predecessors, (471), 398 states have return successors, (657), 458 states have call predecessors, (657), 471 states have call successors, (657) [2022-11-03 01:37:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 4609 transitions. [2022-11-03 01:37:09,305 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 4609 transitions. Word has length 103 [2022-11-03 01:37:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:09,306 INFO L495 AbstractCegarLoop]: Abstraction has 3803 states and 4609 transitions. [2022-11-03 01:37:09,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 01:37:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 4609 transitions. [2022-11-03 01:37:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-03 01:37:09,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:09,313 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:37:09,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:09,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:09,525 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:09,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1829084049, now seen corresponding path program 1 times [2022-11-03 01:37:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:09,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424159590] [2022-11-03 01:37:09,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:37:10,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:10,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424159590] [2022-11-03 01:37:10,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424159590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:10,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092480099] [2022-11-03 01:37:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:10,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:10,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:10,243 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:10,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:37:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:10,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 01:37:10,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:37:10,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:37:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-03 01:37:10,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092480099] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:37:10,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378686430] [2022-11-03 01:37:10,842 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-11-03 01:37:10,842 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:37:10,845 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:37:10,851 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:37:10,851 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:37:25,917 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 189 for LOIs [2022-11-03 01:37:27,822 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 61 for LOIs [2022-11-03 01:37:27,855 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 195 for LOIs [2022-11-03 01:37:27,918 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 81 for LOIs [2022-11-03 01:37:28,118 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 61 for LOIs [2022-11-03 01:37:28,688 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 219 for LOIs [2022-11-03 01:37:29,263 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:37:58,614 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '146038#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= ~t1_pc~0 0) (<= |#NULL.offset| 0) (<= ~q_req_up~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (<= 0 ~q_ev~0) (= 0 ~t2_pc~0) (<= ~m_i~0 1) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= 0 ~q_req_up~0) (<= ~q_ev~0 0) (= ~a_t~0 0) (<= 0 |#NULL.offset|) (<= 0 ~fast_clk_edge~0) (<= ~fast_clk_edge~0 0) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 01:37:58,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:37:58,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:37:58,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2022-11-03 01:37:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474014917] [2022-11-03 01:37:58,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:37:58,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 01:37:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 01:37:58,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2022-11-03 01:37:58,619 INFO L87 Difference]: Start difference. First operand 3803 states and 4609 transitions. Second operand has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 01:38:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:01,862 INFO L93 Difference]: Finished difference Result 8019 states and 9712 transitions. [2022-11-03 01:38:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-11-03 01:38:01,862 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 109 [2022-11-03 01:38:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:01,878 INFO L225 Difference]: With dead ends: 8019 [2022-11-03 01:38:01,878 INFO L226 Difference]: Without dead ends: 4213 [2022-11-03 01:38:01,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 302 SyntacticMatches, 17 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8677 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=1392, Invalid=18068, Unknown=0, NotChecked=0, Total=19460 [2022-11-03 01:38:01,893 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 783 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:01,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1916 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 01:38:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2022-11-03 01:38:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 3133. [2022-11-03 01:38:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 2451 states have (on average 1.1623827009383925) internal successors, (2849), 2487 states have internal predecessors, (2849), 343 states have call successors, (343), 307 states have call predecessors, (343), 338 states have return successors, (449), 338 states have call predecessors, (449), 343 states have call successors, (449) [2022-11-03 01:38:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 3641 transitions. [2022-11-03 01:38:02,333 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 3641 transitions. Word has length 109 [2022-11-03 01:38:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:02,333 INFO L495 AbstractCegarLoop]: Abstraction has 3133 states and 3641 transitions. [2022-11-03 01:38:02,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 01:38:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 3641 transitions. [2022-11-03 01:38:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-03 01:38:02,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:02,341 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:02,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-03 01:38:02,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:02,557 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:38:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1694649747, now seen corresponding path program 1 times [2022-11-03 01:38:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:02,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918128793] [2022-11-03 01:38:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:38:03,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:03,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918128793] [2022-11-03 01:38:03,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918128793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:03,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925732333] [2022-11-03 01:38:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:03,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:03,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:03,097 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:03,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:38:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:03,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 01:38:03,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:38:03,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-03 01:38:03,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925732333] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:03,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [427405384] [2022-11-03 01:38:03,717 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-11-03 01:38:03,717 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:38:03,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:38:03,718 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:38:03,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:38:11,422 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 199 for LOIs [2022-11-03 01:38:15,484 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 73 for LOIs [2022-11-03 01:38:15,491 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 205 for LOIs [2022-11-03 01:38:15,565 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 82 for LOIs [2022-11-03 01:38:15,670 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 73 for LOIs [2022-11-03 01:38:16,109 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 229 for LOIs [2022-11-03 01:38:18,520 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:38:37,944 WARN L234 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 317 DAG size of output: 192 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:38:51,973 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '162493#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 01:38:51,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:38:51,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:38:51,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2022-11-03 01:38:51,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738255285] [2022-11-03 01:38:51,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:38:51,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 01:38:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 01:38:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=4692, Unknown=0, NotChecked=0, Total=5112 [2022-11-03 01:38:51,978 INFO L87 Difference]: Start difference. First operand 3133 states and 3641 transitions. Second operand has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 01:38:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:56,268 INFO L93 Difference]: Finished difference Result 5956 states and 6977 transitions. [2022-11-03 01:38:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-11-03 01:38:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 112 [2022-11-03 01:38:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:56,279 INFO L225 Difference]: With dead ends: 5956 [2022-11-03 01:38:56,279 INFO L226 Difference]: Without dead ends: 2966 [2022-11-03 01:38:56,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 315 SyntacticMatches, 12 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13808 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=1821, Invalid=28979, Unknown=0, NotChecked=0, Total=30800 [2022-11-03 01:38:56,293 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1092 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:56,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1684 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 01:38:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2022-11-03 01:38:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2328. [2022-11-03 01:38:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 1828 states have (on average 1.1564551422319476) internal successors, (2114), 1857 states have internal predecessors, (2114), 245 states have call successors, (245), 225 states have call predecessors, (245), 254 states have return successors, (331), 245 states have call predecessors, (331), 245 states have call successors, (331) [2022-11-03 01:38:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 2690 transitions. [2022-11-03 01:38:56,632 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 2690 transitions. Word has length 112 [2022-11-03 01:38:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:56,632 INFO L495 AbstractCegarLoop]: Abstraction has 2328 states and 2690 transitions. [2022-11-03 01:38:56,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 01:38:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2690 transitions. [2022-11-03 01:38:56,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-03 01:38:56,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:56,635 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:56,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:56,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 01:38:56,849 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:38:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1815227635, now seen corresponding path program 1 times [2022-11-03 01:38:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:38:56,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699228737] [2022-11-03 01:38:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:56,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:38:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 01:38:57,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:38:57,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699228737] [2022-11-03 01:38:57,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699228737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:57,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708372437] [2022-11-03 01:38:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:57,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:57,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:57,498 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:57,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:38:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:57,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:38:57,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-03 01:38:57,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-03 01:38:58,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708372437] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:58,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1040358947] [2022-11-03 01:38:58,792 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-11-03 01:38:58,792 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:38:58,792 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:38:58,792 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:38:58,792 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:39:16,044 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 130 for LOIs [2022-11-03 01:39:16,079 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 130 for LOIs [2022-11-03 01:39:16,108 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 151 for LOIs [2022-11-03 01:39:16,135 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 140 for LOIs [2022-11-03 01:39:16,387 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 132 for LOIs [2022-11-03 01:39:16,840 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 151 for LOIs [2022-11-03 01:39:16,879 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:39:42,633 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '174929#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 01:39:42,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:39:42,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:39:42,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2022-11-03 01:39:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712730549] [2022-11-03 01:39:42,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:39:42,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:39:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:39:42,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=6242, Unknown=0, NotChecked=0, Total=6806 [2022-11-03 01:39:42,637 INFO L87 Difference]: Start difference. First operand 2328 states and 2690 transitions. Second operand has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-03 01:39:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:48,834 INFO L93 Difference]: Finished difference Result 6737 states and 8021 transitions. [2022-11-03 01:39:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-03 01:39:48,836 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 115 [2022-11-03 01:39:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:48,851 INFO L225 Difference]: With dead ends: 6737 [2022-11-03 01:39:48,851 INFO L226 Difference]: Without dead ends: 5053 [2022-11-03 01:39:48,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 280 SyntacticMatches, 22 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10764 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=2637, Invalid=21543, Unknown=0, NotChecked=0, Total=24180 [2022-11-03 01:39:48,863 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 2724 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 2906 mSolverCounterSat, 1720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1720 IncrementalHoareTripleChecker+Valid, 2906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:48,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 992 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1720 Valid, 2906 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-03 01:39:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5053 states. [2022-11-03 01:39:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5053 to 2015. [2022-11-03 01:39:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1578 states have (on average 1.1546261089987326) internal successors, (1822), 1591 states have internal predecessors, (1822), 226 states have call successors, (226), 208 states have call predecessors, (226), 210 states have return successors, (268), 215 states have call predecessors, (268), 226 states have call successors, (268) [2022-11-03 01:39:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2316 transitions. [2022-11-03 01:39:49,336 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2316 transitions. Word has length 115 [2022-11-03 01:39:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:49,337 INFO L495 AbstractCegarLoop]: Abstraction has 2015 states and 2316 transitions. [2022-11-03 01:39:49,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-03 01:39:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2316 transitions. [2022-11-03 01:39:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-03 01:39:49,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:49,340 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:49,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:49,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 01:39:49,554 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash 600715879, now seen corresponding path program 1 times [2022-11-03 01:39:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122567781] [2022-11-03 01:39:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-03 01:39:49,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:49,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122567781] [2022-11-03 01:39:49,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122567781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:49,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:39:49,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:39:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732586717] [2022-11-03 01:39:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:49,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:39:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:39:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:39:49,805 INFO L87 Difference]: Start difference. First operand 2015 states and 2316 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 01:39:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:50,777 INFO L93 Difference]: Finished difference Result 5661 states and 6543 transitions. [2022-11-03 01:39:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:39:50,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 127 [2022-11-03 01:39:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:50,788 INFO L225 Difference]: With dead ends: 5661 [2022-11-03 01:39:50,788 INFO L226 Difference]: Without dead ends: 4346 [2022-11-03 01:39:50,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:39:50,793 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 227 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:50,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 546 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:39:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2022-11-03 01:39:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 2978. [2022-11-03 01:39:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2978 states, 2319 states have (on average 1.1604139715394566) internal successors, (2691), 2337 states have internal predecessors, (2691), 341 states have call successors, (341), 307 states have call predecessors, (341), 317 states have return successors, (399), 333 states have call predecessors, (399), 341 states have call successors, (399) [2022-11-03 01:39:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 3431 transitions. [2022-11-03 01:39:51,483 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 3431 transitions. Word has length 127 [2022-11-03 01:39:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:51,484 INFO L495 AbstractCegarLoop]: Abstraction has 2978 states and 3431 transitions. [2022-11-03 01:39:51,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 01:39:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 3431 transitions. [2022-11-03 01:39:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-03 01:39:51,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:51,489 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:51,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 01:39:51,490 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1766197489, now seen corresponding path program 1 times [2022-11-03 01:39:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:51,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254363336] [2022-11-03 01:39:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-03 01:39:51,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254363336] [2022-11-03 01:39:51,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254363336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:51,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989382415] [2022-11-03 01:39:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:51,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:51,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:51,666 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:51,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 01:39:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:51,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:39:51,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-03 01:39:51,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:51,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989382415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:51,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:51,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-03 01:39:51,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806788817] [2022-11-03 01:39:51,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:51,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:39:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:51,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:39:51,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:51,879 INFO L87 Difference]: Start difference. First operand 2978 states and 3431 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-03 01:39:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:52,271 INFO L93 Difference]: Finished difference Result 4337 states and 4969 transitions. [2022-11-03 01:39:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:39:52,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 158 [2022-11-03 01:39:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:52,278 INFO L225 Difference]: With dead ends: 4337 [2022-11-03 01:39:52,278 INFO L226 Difference]: Without dead ends: 1812 [2022-11-03 01:39:52,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:39:52,284 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:52,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 329 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:39:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2022-11-03 01:39:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1620. [2022-11-03 01:39:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1263 states have (on average 1.1282660332541568) internal successors, (1425), 1274 states have internal predecessors, (1425), 180 states have call successors, (180), 164 states have call predecessors, (180), 176 states have return successors, (212), 181 states have call predecessors, (212), 180 states have call successors, (212) [2022-11-03 01:39:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1817 transitions. [2022-11-03 01:39:52,644 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1817 transitions. Word has length 158 [2022-11-03 01:39:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:52,644 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 1817 transitions. [2022-11-03 01:39:52,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-03 01:39:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1817 transitions. [2022-11-03 01:39:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-03 01:39:52,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:52,648 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:39:52,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:52,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:52,873 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1463275868, now seen corresponding path program 1 times [2022-11-03 01:39:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:52,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301790933] [2022-11-03 01:39:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-03 01:39:53,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301790933] [2022-11-03 01:39:53,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301790933] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:53,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254080862] [2022-11-03 01:39:53,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:53,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:53,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:53,053 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:53,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 01:39:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:53,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:39:53,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-03 01:39:53,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:53,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254080862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:53,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:53,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 01:39:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011617245] [2022-11-03 01:39:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:53,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:39:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:39:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:39:53,273 INFO L87 Difference]: Start difference. First operand 1620 states and 1817 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-03 01:39:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:53,628 INFO L93 Difference]: Finished difference Result 2973 states and 3336 transitions. [2022-11-03 01:39:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:39:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-11-03 01:39:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:53,635 INFO L225 Difference]: With dead ends: 2973 [2022-11-03 01:39:53,635 INFO L226 Difference]: Without dead ends: 1631 [2022-11-03 01:39:53,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:53,639 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:53,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 376 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:39:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-11-03 01:39:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1584. [2022-11-03 01:39:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1231 states have (on average 1.1039805036555645) internal successors, (1359), 1243 states have internal predecessors, (1359), 178 states have call successors, (178), 160 states have call predecessors, (178), 174 states have return successors, (212), 180 states have call predecessors, (212), 178 states have call successors, (212) [2022-11-03 01:39:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1749 transitions. [2022-11-03 01:39:53,902 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1749 transitions. Word has length 159 [2022-11-03 01:39:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:53,903 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 1749 transitions. [2022-11-03 01:39:53,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-03 01:39:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1749 transitions. [2022-11-03 01:39:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-03 01:39:53,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:53,907 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:39:53,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:54,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 01:39:54,130 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:39:54,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2072401531, now seen corresponding path program 1 times [2022-11-03 01:39:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:39:54,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548463326] [2022-11-03 01:39:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:39:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-03 01:39:54,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:39:54,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548463326] [2022-11-03 01:39:54,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548463326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:39:54,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395180524] [2022-11-03 01:39:54,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:54,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:54,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:54,383 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:54,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 01:39:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:54,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 01:39:54,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-03 01:39:54,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:39:54,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395180524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:39:54,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:39:54,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 01:39:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198546664] [2022-11-03 01:39:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:39:54,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:39:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:39:54,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:39:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:39:54,643 INFO L87 Difference]: Start difference. First operand 1584 states and 1749 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-03 01:39:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:55,050 INFO L93 Difference]: Finished difference Result 2048 states and 2262 transitions. [2022-11-03 01:39:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:39:55,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 160 [2022-11-03 01:39:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:55,053 INFO L225 Difference]: With dead ends: 2048 [2022-11-03 01:39:55,054 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 01:39:55,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:39:55,060 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 143 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:55,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 209 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:39:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 01:39:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 01:39:55,061 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) [2022-11-03 01:39:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 01:39:55,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2022-11-03 01:39:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:55,062 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 01:39:55,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-03 01:39:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 01:39:55,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 01:39:55,068 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 01:39:55,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 01:39:55,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:55,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 01:39:55,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 01:40:21,324 WARN L234 SmtUtils]: Spent 14.76s on a formula simplification. DAG size of input: 516 DAG size of output: 466 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 01:40:41,778 WARN L234 SmtUtils]: Spent 14.16s on a formula simplification. DAG size of input: 516 DAG size of output: 466 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 01:41:22,591 WARN L234 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 611 DAG size of output: 165 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 01:41:42,175 WARN L234 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 597 DAG size of output: 191 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 01:41:48,153 WARN L234 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 561 DAG size of output: 177 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 01:42:11,571 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 655 DAG size of output: 171 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 01:42:11,577 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1029 1039) no Hoare annotation was computed. [2022-11-03 01:42:11,578 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 1029 1039) the Hoare annotation is: (let ((.cse39 (= 0 ~t2_st~0)) (.cse0 (+ ~local~0 1)) (.cse14 (= |old(~m_st~0)| 0)) (.cse28 (= ~m_pc~0 1)) (.cse41 (= ~t1_pc~0 1)) (.cse42 (<= 2 ~E_1~0)) (.cse16 (= ~t1_i~0 1)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse43 (= ~t2_pc~0 1)) (.cse21 (= ~t2_i~0 1)) (.cse22 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (= |old(~t2_st~0)| ~t2_st~0)) (.cse38 (= ~t1_st~0 0))) (let ((.cse27 (and .cse18 .cse20 .cse38)) (.cse3 (and .cse41 .cse42 .cse16 .cse17 .cse18 .cse19 .cse20 .cse43 .cse21 .cse22)) (.cse25 (not (= 2 |old(~t2_st~0)|))) (.cse29 (and .cse41 .cse42 .cse16 .cse17 (not .cse28) .cse18 .cse19 .cse20 .cse43 .cse21 .cse22)) (.cse9 (not .cse43)) (.cse10 (not .cse42)) (.cse12 (= ~E_M~0 1)) (.cse31 (and (not .cse14) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse32 (not (= ~E_1~0 2))) (.cse33 (not (<= .cse0 ~token~0))) (.cse8 (not (= 2 |old(~m_st~0)|))) (.cse34 (not (<= ~token~0 .cse0))) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse30 (not (= ~t1_pc~0 0))) (.cse1 (not .cse21)) (.cse13 (not (= ~E_M~0 2))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse35 (not (= |old(~t2_st~0)| 0))) (.cse2 (not .cse41)) (.cse40 (not (= ~m_pc~0 0))) (.cse4 (not .cse16)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse23 (not (<= ~local~0 ~token~0))) (.cse36 (and .cse17 .cse18 .cse39)) (.cse6 (not .cse19)) (.cse24 (not (= ~E_1~0 1))) (.cse7 (not (= |old(~t1_st~0)| 2))) (.cse37 (not (= 0 ~t2_pc~0))) (.cse11 (not (<= 2 ~E_2~0)))) (and (or (not (< .cse0 ~token~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= ~token~0 (+ 2 ~local~0))) (not .cse12)) (or .cse1 .cse13 .cse14 .cse15 .cse2 .cse4 .cse5 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse6 .cse24 .cse7 .cse9 .cse25 .cse11) (or .cse26 .cse1 .cse27 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11) (or .cse26 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse13 .cse14 .cse15 .cse27 .cse4 .cse5 .cse30 .cse23 .cse6 .cse24 .cse9 .cse25 .cse11) (or .cse1 .cse31 .cse2 .cse3 .cse32 .cse4 .cse5 .cse33 .cse6 .cse8 .cse9 .cse25 .cse10 .cse34) (or .cse1 .cse35 .cse2 .cse4 .cse5 .cse28 .cse36 .cse6 .cse37 .cse8 .cse10 .cse12) (or .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse35 .cse31 .cse2 .cse32 .cse4 .cse5 .cse33 .cse36 .cse6 .cse37 .cse8 .cse34) (or .cse26 .cse1 .cse13 .cse14 .cse15 .cse35 (and .cse18 .cse38 .cse39) .cse40 .cse4 .cse5 .cse30 .cse23 .cse6 .cse24 .cse37 .cse11) (or .cse1 .cse13 .cse14 .cse15 .cse35 .cse2 .cse40 .cse4 .cse5 .cse23 .cse36 .cse6 .cse24 .cse7 .cse37 .cse11)))) [2022-11-03 01:42:11,578 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1029 1039) no Hoare annotation was computed. [2022-11-03 01:42:11,579 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2022-11-03 01:42:11,579 INFO L902 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: true [2022-11-03 01:42:11,580 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 995 1028) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 1)) (.cse2 (= |old(~m_st~0)| 0))) (let ((.cse48 (= 0 ~t2_pc~0)) (.cse49 (= 0 ~t2_st~0)) (.cse50 (+ ~local~0 1)) (.cse44 (not .cse2)) (.cse35 (= ~t1_pc~0 1)) (.cse36 (<= 2 ~E_1~0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (not .cse23)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse47 (<= 2 ~E_2~0)) (.cse37 (= ~t2_pc~0 1)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= |old(~t2_st~0)| ~t2_st~0)) (.cse51 (= ~t1_st~0 0))) (let ((.cse22 (and .cse9 .cse11 .cse51)) (.cse34 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse47 .cse37 .cse12 .cse13)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse27 (and .cse44 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse28 (not (= ~E_1~0 2))) (.cse38 (not (<= .cse50 ~token~0))) (.cse39 (not (<= ~token~0 .cse50))) (.cse31 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse12 .cse13 .cse48 .cse49)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse33 (and .cse9 .cse51 .cse49)) (.cse29 (not (= ~t1_pc~0 0))) (.cse43 (not (< .cse50 ~token~0))) (.cse26 (and .cse35 .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse47 .cse37 .cse12 .cse13)) (.cse24 (not (= 2 |old(~m_st~0)|))) (.cse18 (not .cse37)) (.cse25 (not .cse36)) (.cse45 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse41 (= ~E_M~0 1)) (.cse0 (not .cse12)) (.cse1 (not (= ~E_M~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse30 (not (= |old(~t2_st~0)| 0))) (.cse4 (not .cse35)) (.cse42 (not (= ~m_pc~0 0))) (.cse5 (not .cse7)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse14 (not (<= ~local~0 ~token~0))) (.cse46 (and .cse8 .cse9 .cse49)) (.cse15 (not .cse10)) (.cse16 (not (= ~E_1~0 1))) (.cse17 (not (= |old(~t1_st~0)| 2))) (.cse32 (not .cse48)) (.cse20 (not .cse47))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse22 .cse5 .cse6 .cse23 .cse15 .cse24 .cse18 .cse25 .cse20) (or .cse0 .cse26 .cse27 .cse4 .cse28 .cse5 .cse6 .cse15 .cse17 .cse24 .cse18 .cse19 .cse25 .cse20) (or .cse21 (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse29 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (or .cse0 .cse30 .cse4 .cse5 .cse6 .cse23 .cse31 .cse15 .cse32 .cse24 .cse25 .cse20) (or .cse21 .cse0 .cse30 .cse33 .cse5 .cse6 .cse23 .cse15 .cse32 .cse24 .cse25 .cse20) (or .cse0 .cse4 .cse5 .cse6 .cse34 .cse23 .cse15 .cse24 .cse18 .cse25 .cse20) (or .cse0 .cse27 .cse4 (and .cse35 .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13) .cse28 .cse5 .cse6 .cse38 .cse15 .cse24 .cse18 .cse19 .cse25 .cse39) (or .cse0 .cse4 .cse5 .cse6 .cse23 .cse15 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13) .cse24 .cse18 .cse25 .cse41) (or .cse21 .cse0 .cse1 .cse3 .cse30 .cse27 .cse33 .cse42 .cse28 .cse5 .cse6 .cse29 .cse14 .cse15 .cse32 .cse20) (or .cse0 .cse1 .cse4 .cse42 .cse5 .cse6 .cse34 .cse23 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20) (or .cse43 .cse0 .cse1 .cse26 .cse4 .cse5 .cse6 .cse15 .cse44 .cse17 .cse18 .cse19 .cse25 .cse20 .cse45) (or .cse0 .cse30 .cse27 .cse4 .cse28 .cse5 .cse6 .cse38 .cse46 .cse15 .cse32 .cse24 .cse39) (or .cse0 .cse30 .cse4 .cse5 .cse6 .cse23 .cse31 .cse15 .cse32 .cse24 .cse25 .cse41) (or .cse21 .cse0 .cse1 .cse2 .cse3 .cse30 .cse33 .cse42 .cse5 .cse6 .cse29 .cse14 .cse15 .cse16 .cse32 .cse20) (or .cse43 .cse0 .cse26 .cse4 .cse5 .cse6 .cse15 .cse17 .cse24 .cse18 .cse25 .cse20 .cse45 (not .cse41)) (or .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse42 .cse5 .cse6 .cse14 .cse46 .cse15 .cse16 .cse17 .cse32 .cse20))))) [2022-11-03 01:42:11,580 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 792) no Hoare annotation was computed. [2022-11-03 01:42:11,580 INFO L899 garLoopResultBuilder]: For program point L783-2(lines 783 792) no Hoare annotation was computed. [2022-11-03 01:42:11,580 INFO L899 garLoopResultBuilder]: For program point L746(lines 746 751) no Hoare annotation was computed. [2022-11-03 01:42:11,581 INFO L895 garLoopResultBuilder]: At program point L775(lines 763 777) the Hoare annotation is: (let ((.cse37 (= ~E_M~0 1)) (.cse31 (= ~m_pc~0 1)) (.cse45 (= |old(~m_st~0)| 0))) (let ((.cse43 (not .cse45)) (.cse54 (+ ~local~0 1)) (.cse57 (= ~t1_st~0 0)) (.cse26 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse20 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse21 (= ~t1_pc~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (not (= ~m_pc~0 ~t1_pc~0))) (.cse55 (= ~m_st~0 2)) (.cse13 (= ~t1_i~0 1)) (.cse14 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (not .cse31)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= |old(~t2_st~0)| ~t2_st~0)) (.cse28 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse56 (= 0 ~t2_pc~0)) (.cse19 (= 0 ~t2_st~0)) (.cse53 (not .cse37))) (let ((.cse0 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse28 .cse18 .cse56 .cse19 .cse53)) (.cse41 (and .cse21 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18 .cse20)) (.cse39 (and .cse14 .cse16 .cse25 .cse57 .cse20)) (.cse42 (not (< .cse54 ~token~0))) (.cse40 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18)) (.cse44 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse49 (not (= ~E_1~0 1))) (.cse32 (not (= |old(~t1_st~0)| 2))) (.cse52 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse29 (not (= ~E_M~0 2))) (.cse46 (not (<= ~token~0 ~local~0))) (.cse30 (not (= ~m_pc~0 0))) (.cse47 (not (= ~t1_pc~0 0))) (.cse48 (not (<= ~local~0 ~token~0))) (.cse38 (not (= |old(~t1_st~0)| 0))) (.cse50 (and .cse14 .cse16 .cse57 .cse19 .cse20)) (.cse2 (not (= |old(~t2_st~0)| 0))) (.cse10 (not .cse56)) (.cse36 (not .cse26)) (.cse1 (not .cse28)) (.cse3 (and .cse43 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse4 (not .cse21)) (.cse5 (not (= ~E_1~0 2))) (.cse6 (not .cse13)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (<= .cse54 ~token~0))) (.cse9 (not .cse17)) (.cse51 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse27 .cse28 .cse18 .cse53)) (.cse11 (not (= 2 |old(~m_st~0)|))) (.cse33 (not .cse27)) (.cse34 (not (= 2 |old(~t2_st~0)|))) (.cse35 (not .cse22)) (.cse12 (not (<= ~token~0 .cse54)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse1 (and .cse21 .cse22 .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18 .cse20) .cse29 .cse4 .cse30 .cse6 .cse7 .cse31 .cse9 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse35 .cse37) (or .cse21 .cse38 .cse1 .cse6 .cse7 .cse31 .cse9 .cse39 .cse11 .cse33 .cse35 .cse36) (or .cse1 .cse4 .cse6 .cse7 .cse31 .cse9 .cse40 .cse11 .cse33 .cse35 .cse36) (or .cse1 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse32 .cse40 .cse11 .cse33 .cse34 .cse35 .cse36) (or .cse42 .cse1 .cse29 .cse41 .cse4 .cse6 .cse7 .cse9 .cse43 .cse32 .cse33 .cse34 .cse35 .cse36 .cse44) (or .cse38 .cse23 .cse1 .cse29 .cse45 .cse46 .cse6 .cse7 .cse47 .cse48 .cse9 .cse49 .cse39 .cse33 .cse34 .cse36) (or .cse38 .cse1 .cse50 .cse29 .cse45 .cse46 .cse2 .cse30 .cse6 .cse7 .cse47 .cse48 .cse9 .cse49 .cse10 .cse36) (or .cse1 .cse4 .cse6 .cse7 .cse31 .cse9 .cse51 .cse11 .cse33 .cse35 .cse37) (or .cse1 .cse29 .cse45 .cse46 .cse4 .cse6 .cse7 .cse48 .cse9 .cse49 .cse32 .cse33 .cse34 .cse36 (and .cse52 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18)) (or .cse42 .cse1 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) (= ~m_st~0 0) (= 2 ~t1_st~0) .cse25 .cse20) .cse4 .cse6 .cse7 .cse9 .cse32 .cse40 .cse11 .cse33 .cse35 .cse36 .cse44 .cse53) (or .cse1 .cse29 .cse45 .cse46 .cse2 .cse4 .cse30 .cse6 .cse7 .cse48 .cse9 .cse49 .cse32 (and .cse52 .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19) .cse10 .cse36) (or .cse38 .cse1 .cse50 .cse29 .cse46 .cse2 .cse3 .cse30 .cse5 .cse6 .cse7 .cse47 .cse48 .cse9 .cse10 .cse36) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse31 (and .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19) .cse9 .cse10 .cse11 .cse35 .cse36) (or .cse21 .cse38 .cse1 .cse50 .cse2 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse35 .cse36) (or .cse1 (and .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse28 .cse18 .cse20) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse51 .cse11 .cse33 .cse34 .cse35 .cse12))))) [2022-11-03 01:42:11,582 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2022-11-03 01:42:11,582 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 773) no Hoare annotation was computed. [2022-11-03 01:42:11,582 INFO L899 garLoopResultBuilder]: For program point L764-2(lines 764 773) no Hoare annotation was computed. [2022-11-03 01:42:11,583 INFO L895 garLoopResultBuilder]: At program point L756(lines 744 758) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 1)) (.cse13 (= |old(~m_st~0)| 0))) (let ((.cse47 (not .cse13)) (.cse49 (<= 2 ~E_2~0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~E_1~0)) (.cse24 (= ~t1_i~0 1)) (.cse27 (not .cse4)) (.cse29 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse30 (= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (= ~t2_i~0 1)) (.cse33 (= ~c_dr_pc~0 0)) (.cse52 (= 0 ~t2_pc~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse50 (+ ~local~0 1)) (.cse25 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse51 (= ~t1_st~0 0)) (.cse43 (= 0 ~t2_st~0))) (let ((.cse16 (and .cse25 .cse28 .cse51 .cse43)) (.cse18 (not (= ~t1_pc~0 0))) (.cse38 (not (<= .cse50 ~token~0))) (.cse39 (not (<= ~token~0 .cse50))) (.cse35 (and .cse25 .cse26 .cse28 .cse43)) (.cse15 (not (= |old(~t2_st~0)| 0))) (.cse40 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse52 .cse43)) (.cse21 (not .cse52)) (.cse14 (not (<= ~token~0 ~local~0))) (.cse19 (not (<= ~local~0 ~token~0))) (.cse20 (not (= ~E_1~0 1))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse41 (and .cse25 .cse28 .cse30 .cse51)) (.cse46 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse49 .cse31 .cse33)) (.cse36 (and .cse47 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse37 (not (= ~E_1~0 2))) (.cse45 (not (< .cse50 ~token~0))) (.cse6 (not (= 2 |old(~m_st~0)|))) (.cse9 (and .cse22 .cse23 (= ~m_st~0 2) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse49 .cse31 .cse32 .cse33)) (.cse48 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse34 (= ~E_M~0 1)) (.cse0 (not .cse32)) (.cse12 (not (= ~E_M~0 2))) (.cse1 (not .cse22)) (.cse17 (not (= ~m_pc~0 0))) (.cse2 (not .cse24)) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse5 (not .cse29)) (.cse44 (not (= |old(~t1_st~0)| 2))) (.cse7 (not .cse31)) (.cse42 (not (= 2 |old(~t2_st~0)|))) (.cse8 (not .cse23)) (.cse10 (not .cse49))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse2 .cse3 .cse18 .cse19 .cse5 .cse20 .cse21 .cse10) (or .cse0 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse34) (or .cse0 .cse35 .cse15 .cse36 .cse1 .cse37 .cse2 .cse3 .cse38 .cse5 .cse21 .cse6 .cse39) (or .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse6 .cse8 .cse34) (or .cse11 (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse12 .cse13 .cse14 .cse2 .cse3 .cse18 .cse19 .cse41 .cse5 .cse20 .cse7 .cse42 .cse10) (or .cse11 .cse0 .cse12 .cse14 .cse15 .cse36 .cse16 .cse17 .cse37 .cse2 .cse3 .cse18 .cse19 .cse5 .cse21 .cse10) (or .cse0 .cse36 .cse1 .cse37 .cse2 .cse3 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse33) .cse38 .cse5 .cse6 .cse7 .cse42 .cse8 .cse39) (or .cse11 .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse43) .cse21 .cse6 .cse8 .cse10) (or .cse0 .cse35 .cse12 .cse13 .cse14 .cse15 .cse1 .cse17 .cse2 .cse3 .cse19 .cse5 .cse20 .cse44 .cse21 .cse10) (or .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse6 .cse8 .cse10) (or .cse0 .cse12 .cse13 .cse14 .cse1 .cse2 .cse3 .cse19 .cse5 .cse20 .cse44 (and .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse33) .cse7 .cse42 .cse10) (or .cse45 .cse0 .cse12 .cse46 .cse1 .cse2 .cse3 .cse5 .cse47 .cse44 .cse7 .cse42 .cse8 .cse10 .cse48) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse46 .cse36 .cse1 .cse37 .cse2 .cse3 .cse5 .cse44 .cse6 .cse7 .cse42 .cse8 .cse10) (or .cse45 .cse0 .cse1 .cse2 .cse3 (and .cse22 .cse23 (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse24 .cse26 .cse28 .cse29 .cse30 .cse49 .cse31 .cse33) .cse5 .cse44 .cse6 .cse7 .cse8 .cse9 .cse10 .cse48 (not .cse34)) (or .cse0 .cse12 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse44 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse49 .cse31 .cse32 .cse33) .cse7 .cse42 .cse8 .cse10))))) [2022-11-03 01:42:11,583 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 770) no Hoare annotation was computed. [2022-11-03 01:42:11,584 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 995 1028) no Hoare annotation was computed. [2022-11-03 01:42:11,584 INFO L895 garLoopResultBuilder]: At program point L794(lines 782 796) the Hoare annotation is: (let ((.cse26 (= ~E_M~0 1)) (.cse23 (= ~m_pc~0 1)) (.cse36 (= |old(~m_st~0)| 0))) (let ((.cse55 (<= 2 ~E_2~0)) (.cse60 (= 0 ~t2_pc~0)) (.cse44 (not .cse36)) (.cse59 (+ ~local~0 1)) (.cse48 (= 0 ~t2_st~0)) (.cse41 (= ~t1_st~0 0)) (.cse57 (= ~t1_pc~0 1)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse58 (= ~m_st~0 2)) (.cse3 (not .cse23)) (.cse56 (= ~t2_pc~0 1)) (.cse54 (not .cse26)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse27 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (= |old(~t2_st~0)| ~t2_st~0)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse30 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (let ((.cse13 (and .cse0 .cse2 .cse27 .cse28 .cse40 .cse29 .cse4 .cse5 .cse6 .cse7 .cse30)) (.cse31 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse56 .cse6 .cse7 .cse54)) (.cse49 (and .cse57 .cse2 .cse28 .cse3 .cse4 .cse41 .cse7)) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse50 (not (= ~m_pc~0 0))) (.cse38 (not (= ~t1_pc~0 0))) (.cse52 (and .cse27 .cse40 .cse29 .cse41 .cse48 .cse30)) (.cse43 (not (< .cse59 ~token~0))) (.cse45 (= ~m_st~0 0)) (.cse46 (= 2 ~t1_st~0)) (.cse47 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse22 (not (= |old(~t2_st~0)| 0))) (.cse9 (and .cse44 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse11 (not (= ~E_1~0 2))) (.cse32 (not (<= .cse59 ~token~0))) (.cse24 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse60 .cse48 .cse54)) (.cse25 (not .cse60)) (.cse33 (not (<= ~token~0 .cse59))) (.cse53 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse55 .cse56 .cse6 .cse7)) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse20 (not .cse0)) (.cse8 (not .cse6)) (.cse51 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse35 (not (= ~E_M~0 2))) (.cse37 (not (<= ~token~0 ~local~0))) (.cse10 (not .cse57)) (.cse12 (not .cse2)) (.cse14 (not (= ~p_dw_pc~0 0))) (.cse39 (not (<= ~local~0 ~token~0))) (.cse15 (not .cse4)) (.cse42 (not (= ~E_1~0 1))) (.cse16 (not (= |old(~t1_st~0)| 2))) (.cse18 (not .cse56)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse21 (not .cse55))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse8 .cse22 .cse10 .cse12 .cse14 .cse23 .cse15 .cse24 .cse25 .cse17 .cse20 .cse26) (or (and .cse0 .cse2 .cse27 .cse28 .cse29 .cse4 .cse5 .cse6 .cse7 (<= 1 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|) .cse30) .cse8 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse15 .cse17 .cse18 .cse19 .cse20 .cse33) (or .cse34 .cse1 .cse8 .cse35 .cse36 .cse37 .cse12 .cse14 .cse38 .cse39 (and .cse27 .cse40 .cse29 .cse5 .cse41 .cse30) .cse15 .cse42 .cse18 .cse19 .cse21) (or .cse43 .cse8 .cse35 .cse10 .cse12 .cse14 .cse15 .cse44 .cse16 .cse18 .cse19 .cse20 (and .cse0 .cse2 .cse27 .cse40 .cse45 .cse46 .cse4 .cse5 .cse6 .cse7 .cse30) .cse21 .cse47) (or .cse34 .cse8 (and .cse27 .cse29 .cse41 .cse48 .cse30) .cse49 .cse22 .cse12 .cse14 .cse23 .cse15 .cse25 .cse17 .cse20 .cse21) (or .cse8 .cse35 .cse10 .cse50 .cse12 .cse14 .cse23 .cse15 .cse16 (and .cse0 .cse1 .cse2 .cse27 .cse28 .cse40 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse30) .cse18 .cse19 .cse20 .cse21) (or .cse8 .cse31 .cse10 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 .cse20 .cse26) (or .cse8 .cse35 .cse36 .cse37 .cse22 .cse10 .cse50 .cse12 .cse14 .cse39 .cse15 .cse42 .cse16 (and .cse51 .cse27 .cse40 .cse29 .cse41 .cse48) .cse25 .cse21) (or .cse34 .cse8 .cse35 .cse37 .cse22 .cse9 .cse50 .cse11 .cse12 .cse14 .cse38 .cse39 .cse15 .cse25 .cse52 .cse21) (or .cse34 .cse8 .cse49 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 (and .cse27 .cse28 .cse29 .cse5 .cse30) .cse20 .cse21) (or .cse8 .cse22 (and .cse1 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse48) .cse10 .cse12 .cse14 .cse23 .cse15 .cse25 .cse17 .cse20 .cse21) (or .cse34 .cse8 .cse35 .cse36 .cse37 .cse22 .cse50 .cse12 .cse14 .cse38 .cse39 .cse15 .cse42 .cse25 .cse52 .cse21) (or .cse43 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse40 .cse45 .cse46 .cse5 .cse30) .cse8 .cse53 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse47 .cse54) (or .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse32 .cse15 .cse24 .cse25 .cse17 .cse33 (and .cse27 .cse28 .cse40 .cse29 .cse48 .cse30)) (or .cse8 .cse53 .cse10 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 .cse20 .cse21) (or .cse8 (and .cse51 .cse27 .cse40 .cse29 .cse5 .cse41) .cse35 .cse36 .cse37 .cse10 .cse12 .cse14 .cse39 .cse15 .cse42 .cse16 .cse18 .cse19 .cse21))))) [2022-11-03 01:42:11,585 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 754) no Hoare annotation was computed. [2022-11-03 01:42:11,585 INFO L899 garLoopResultBuilder]: For program point L745-2(lines 745 754) no Hoare annotation was computed. [2022-11-03 01:42:11,585 INFO L902 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: true [2022-11-03 01:42:11,585 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2022-11-03 01:42:11,585 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2022-11-03 01:42:11,586 INFO L902 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: true [2022-11-03 01:42:11,586 INFO L902 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: true [2022-11-03 01:42:11,586 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2022-11-03 01:42:11,586 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 798 805) no Hoare annotation was computed. [2022-11-03 01:42:11,586 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 798 805) the Hoare annotation is: true [2022-11-03 01:42:11,587 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 919 956) the Hoare annotation is: (let ((.cse24 (= ~t2_pc~0 1)) (.cse22 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse21 (= ~t1_i~0 1)) (.cse19 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse33 (= ~t2_i~0 1)) (.cse18 (not (= ~m_st~0 0))) (.cse20 (<= 2 ~E_1~0)) (.cse25 (<= |old(~E_2~0)| ~E_2~0)) (.cse34 (not (= ~E_M~0 1)))) (let ((.cse9 (and .cse20 .cse25 .cse34)) (.cse10 (not (= 0 ~t2_st~0))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse13 (not (= ~t1_st~0 0))) (.cse29 (not (= 2 |old(~E_1~0)|))) (.cse8 (not (= ~m_st~0 2))) (.cse31 (= ~E_1~0 2)) (.cse30 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse18)) (.cse0 (not (<= 2 |old(~E_2~0)|))) (.cse1 (not .cse33)) (.cse32 (not .cse6)) (.cse23 (<= 2 ~E_2~0)) (.cse26 (= ~c_dr_pc~0 0)) (.cse27 (= ~E_1~0 |old(~E_1~0)|)) (.cse28 (= ~E_M~0 2)) (.cse2 (not .cse19)) (.cse15 (not (= 2 ~t2_st~0))) (.cse16 (not (= 2 |old(~E_M~0)|))) (.cse3 (not .cse21)) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse17 (not (= 2 ~t1_st~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= |old(~E_M~0)| 1)) (.cse11 (not .cse22)) (.cse14 (not .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (< (+ ~local~0 1) ~token~0)) .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse7 .cse11 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse14 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (not (<= ~token~0 ~local~0)) .cse29 .cse16 .cse3 .cse4 (not (= ~t1_pc~0 0)) (not (<= ~local~0 ~token~0)) .cse10 .cse11 .cse12 .cse30 .cse13 (and .cse25 .cse28 .cse31)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 (and .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse24 .cse25 .cse33 .cse26 .cse34) .cse14) (or .cse0 .cse1 .cse2 .cse29 .cse15 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse31) .cse11 .cse30 .cse14) (or .cse0 .cse1 (and .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse24 .cse25 .cse33 .cse26 .cse27 .cse28 .cse34) .cse2 (not (= ~m_pc~0 0)) .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse11 .cse14)))) [2022-11-03 01:42:11,587 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 919 956) no Hoare annotation was computed. [2022-11-03 01:42:11,587 INFO L902 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: true [2022-11-03 01:42:11,587 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2022-11-03 01:42:11,588 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2022-11-03 01:42:11,588 INFO L902 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: true [2022-11-03 01:42:11,588 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-11-03 01:42:11,588 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2022-11-03 01:42:11,588 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2022-11-03 01:42:11,588 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2022-11-03 01:42:11,588 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2022-11-03 01:42:11,589 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2022-11-03 01:42:11,589 INFO L895 garLoopResultBuilder]: At program point L861(line 861) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse22 (= ~m_st~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 0)) (.cse28 (not (= ~E_M~0 1))) (.cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse24 (= ~m_st~0 2)) (.cse25 (<= ~token~0 .cse30)) (.cse26 (<= .cse30 ~token~0)) (.cse29 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (or .cse2 .cse22)) (.cse4 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse15 (= ~t1_pc~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse17 (= 2 ~t2_st~0)) (.cse27 (not (= ~m_pc~0 1))) (.cse18 (= 2 ~t1_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse19 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse23 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9) (and .cse15 .cse1 .cse17 .cse3 .cse21 .cse4 .cse5 .cse19 (not .cse22) .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse23) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse24 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse24 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse29 .cse17 .cse22 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse17 .cse22 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 (< .cse30 ~token~0) .cse9) (and .cse15 .cse1 .cse2 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse13) (and .cse15 .cse1 .cse22 .cse18 .cse3 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse19 .cse26 .cse6 .cse7 .cse9 .cse10 .cse13 .cse23) (and .cse1 .cse29 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse1 .cse17 .cse22 .cse27 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse23)))) [2022-11-03 01:42:11,589 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-11-03 01:42:11,590 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2022-11-03 01:42:11,590 INFO L895 garLoopResultBuilder]: At program point L730(line 730) the Hoare annotation is: (let ((.cse3 (not (= ~m_pc~0 1))) (.cse9 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~t1_st~0 0) .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (= ~E_M~0 1)))) [2022-11-03 01:42:11,590 INFO L899 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2022-11-03 01:42:11,590 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,590 INFO L895 garLoopResultBuilder]: At program point L1127(line 1127) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 01:42:11,591 INFO L895 garLoopResultBuilder]: At program point L1127-1(line 1127) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 01:42:11,591 INFO L899 garLoopResultBuilder]: For program point L863(line 863) no Hoare annotation was computed. [2022-11-03 01:42:11,591 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2022-11-03 01:42:11,591 INFO L895 garLoopResultBuilder]: At program point L599(line 599) the Hoare annotation is: false [2022-11-03 01:42:11,591 INFO L895 garLoopResultBuilder]: At program point L1128(line 1128) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 01:42:11,592 INFO L895 garLoopResultBuilder]: At program point L633(lines 628 667) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) [2022-11-03 01:42:11,592 INFO L895 garLoopResultBuilder]: At program point L898(lines 860 912) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse22 (= ~m_st~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 0)) (.cse28 (not (= ~E_M~0 1))) (.cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse24 (= ~m_st~0 2)) (.cse25 (<= ~token~0 .cse30)) (.cse26 (<= .cse30 ~token~0)) (.cse29 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (or .cse2 .cse22)) (.cse4 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse15 (= ~t1_pc~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse17 (= 2 ~t2_st~0)) (.cse27 (not (= ~m_pc~0 1))) (.cse18 (= 2 ~t1_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse19 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse23 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9) (and .cse15 .cse1 .cse17 .cse3 .cse21 .cse4 .cse5 .cse19 (not .cse22) .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse23) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse24 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse24 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse29 .cse17 .cse22 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse17 .cse22 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 (< .cse30 ~token~0) .cse9) (and .cse15 .cse1 .cse2 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse13) (and .cse15 .cse1 .cse22 .cse18 .cse3 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse19 .cse26 .cse6 .cse7 .cse9 .cse10 .cse13 .cse23) (and .cse1 .cse29 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse1 .cse17 .cse22 .cse27 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse23)))) [2022-11-03 01:42:11,592 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 869) no Hoare annotation was computed. [2022-11-03 01:42:11,592 INFO L899 garLoopResultBuilder]: For program point L865-1(lines 860 912) no Hoare annotation was computed. [2022-11-03 01:42:11,593 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,593 INFO L899 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2022-11-03 01:42:11,593 INFO L895 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-11-03 01:42:11,593 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,593 INFO L895 garLoopResultBuilder]: At program point L471-1(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,594 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2022-11-03 01:42:11,594 INFO L895 garLoopResultBuilder]: At program point L1132-1(lines 1129 1169) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 2)) (.cse18 (not (= ~m_pc~0 1))) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse19 (not (= ~E_M~0 1))) (.cse13 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (= ~t1_i~0 1)) (.cse14 (= 2 ~t2_st~0)) (.cse15 (= 2 ~t1_st~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11) (and .cse12 .cse13 .cse0 .cse14 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 .cse7 .cse9) (and .cse12 .cse13 .cse17 .cse0 .cse18 .cse2 .cse4 .cse16 .cse5 .cse6 .cse19) (and .cse13 .cse17 .cse0 .cse18 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse19) (and .cse13 .cse17 .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse19) (and .cse12 .cse13 .cse17 .cse0 .cse18 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse19) (and .cse12 .cse13 .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse14 .cse1 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 (< (+ ~local~0 1) ~token~0) .cse9) (and .cse12 .cse0 (= ~m_st~0 ~E_M~0) .cse14 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 .cse9 .cse11))) [2022-11-03 01:42:11,594 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 908) no Hoare annotation was computed. [2022-11-03 01:42:11,594 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2022-11-03 01:42:11,594 INFO L899 garLoopResultBuilder]: For program point L870(lines 860 912) no Hoare annotation was computed. [2022-11-03 01:42:11,594 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,595 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2022-11-03 01:42:11,595 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2022-11-03 01:42:11,595 INFO L895 garLoopResultBuilder]: At program point L210(lines 210 214) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= 2 ~p_dw_pc~0))))) [2022-11-03 01:42:11,595 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2022-11-03 01:42:11,595 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,595 INFO L895 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,596 INFO L902 garLoopResultBuilder]: At program point L1170(lines 1117 1175) the Hoare annotation is: true [2022-11-03 01:42:11,596 INFO L895 garLoopResultBuilder]: At program point L1104(line 1104) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-03 01:42:11,596 INFO L895 garLoopResultBuilder]: At program point L1104-1(line 1104) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-03 01:42:11,596 INFO L899 garLoopResultBuilder]: For program point L873(lines 873 880) no Hoare annotation was computed. [2022-11-03 01:42:11,597 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 717) no Hoare annotation was computed. [2022-11-03 01:42:11,597 INFO L895 garLoopResultBuilder]: At program point L676(lines 676 680) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse8 (= 0 ~t2_pc~0)) (.cse9 (= 0 ~t2_st~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse13 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse11 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse14 (= ~E_M~0 2)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse17 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse10) (and .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse15 .cse16 .cse17 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (and .cse12 .cse1 .cse13 .cse2 (= 2 ~t2_st~0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))))) [2022-11-03 01:42:11,597 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,597 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,597 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2022-11-03 01:42:11,598 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,598 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-11-03 01:42:11,598 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-11-03 01:42:11,598 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,598 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2022-11-03 01:42:11,599 INFO L895 garLoopResultBuilder]: At program point L712(lines 712 716) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~local~0 1))) (and .cse0 .cse2 .cse3 (<= ~token~0 .cse11) (= 2 ~t1_st~0) .cse5 .cse6 .cse7 (<= .cse11 ~token~0) .cse8 .cse9 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) (= ~E_M~0 2) (= ~E_1~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))))) [2022-11-03 01:42:11,599 INFO L895 garLoopResultBuilder]: At program point L646(line 646) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse4 (= 2 ~t1_st~0)) (.cse2 (= 2 ~t2_st~0)) (.cse7 (= ~t2_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~E_1~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (= ~t1_st~0 0)) (.cse6 (<= 2 ~E_2~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= 0 ~t2_pc~0)) (.cse11 (= ~E_M~0 2)) (.cse16 (= 0 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse17 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse11 .cse16 .cse12 .cse13 .cse17) (and .cse1 .cse18 .cse2 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse17) (and .cse1 .cse18 .cse3 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse11 .cse16 .cse12 .cse13 .cse17))) [2022-11-03 01:42:11,599 INFO L899 garLoopResultBuilder]: For program point L646-1(line 646) no Hoare annotation was computed. [2022-11-03 01:42:11,599 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 01:42:11,599 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-11-03 01:42:11,600 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2022-11-03 01:42:11,600 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-11-03 01:42:11,600 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-11-03 01:42:11,600 INFO L895 garLoopResultBuilder]: At program point L1144-1(line 1144) the Hoare annotation is: (let ((.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse12 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse15 (= ~E_M~0 2)) (.cse5 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse14 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse15 (= ~E_1~0 2)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse12 (= ~m_st~0 0) .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) .cse15) (and .cse11 .cse0 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (= ~m_pc~0 0) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8))) [2022-11-03 01:42:11,601 INFO L895 garLoopResultBuilder]: At program point L913(lines 854 918) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-11-03 01:42:11,601 INFO L895 garLoopResultBuilder]: At program point L1145(line 1145) the Hoare annotation is: (let ((.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse12 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse15 (= ~E_M~0 2)) (.cse5 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse14 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (= ~m_pc~0 0) .cse15) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse12 (= ~m_st~0 0) .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) .cse15) (and .cse11 .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse15 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8))) [2022-11-03 01:42:11,601 INFO L895 garLoopResultBuilder]: At program point L518(lines 518 527) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,601 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2022-11-03 01:42:11,602 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,602 INFO L895 garLoopResultBuilder]: At program point L1146(line 1146) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-03 01:42:11,602 INFO L895 garLoopResultBuilder]: At program point L684-1(lines 672 703) the Hoare annotation is: (let ((.cse24 (+ ~local~0 1))) (let ((.cse3 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse12 (<= ~token~0 .cse24)) (.cse14 (<= .cse24 ~token~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse9 (= 0 ~t2_st~0)) (.cse20 (<= ~token~0 ~local~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (<= 2 ~E_1~0)) (.cse18 (= ~m_st~0 0)) (.cse19 (= ~m_pc~0 0)) (.cse1 (= ~m_st~0 2)) (.cse11 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse23 (= 2 ~t2_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse13 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~E_1~0 2)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse9 .cse16 .cse17) (and .cse0 .cse11 (= ~t1_pc~0 0) .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse15 .cse9 .cse20 .cse21 .cse16 .cse22 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse10) (and .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse15 .cse9 .cse16 .cse22) (and .cse1 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse20 .cse21 .cse16 .cse22) (and .cse0 .cse11 .cse2 .cse23 .cse18 .cse4 .cse5 .cse13 .cse6 .cse7 .cse19 .cse15 .cse17) (and .cse1 .cse11 .cse2 .cse23 .cse4 .cse5 .cse13 .cse6 .cse7 .cse15 .cse16 .cse17)))) [2022-11-03 01:42:11,602 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2022-11-03 01:42:11,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 01:42:11,603 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2022-11-03 01:42:11,603 INFO L899 garLoopResultBuilder]: For program point L884(lines 860 912) no Hoare annotation was computed. [2022-11-03 01:42:11,603 INFO L899 garLoopResultBuilder]: For program point L1149(line 1149) no Hoare annotation was computed. [2022-11-03 01:42:11,603 INFO L895 garLoopResultBuilder]: At program point L720-1(lines 708 739) the Hoare annotation is: (let ((.cse10 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse20 (+ ~local~0 1)) (.cse11 (= ~m_st~0 0)) (.cse12 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse23 (not .cse10)) (.cse3 (not (= ~m_pc~0 1))) (.cse9 (not (= ~E_M~0 1))) (.cse22 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse5 (= ~t1_st~0 0)) (.cse19 (= ~t1_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse21 (= 2 ~t1_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse13 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse14 (= ~E_M~0 2)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse17 (= ~E_1~0 2)) (.cse18 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse10 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse1 .cse2 (<= ~token~0 .cse20) .cse21 .cse4 .cse6 (<= .cse20 ~token~0) .cse7 .cse8 .cse13 .cse14 .cse17 .cse18) (and .cse19 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse11 .cse21 .cse4 .cse6 .cse7 .cse8 (< .cse20 ~token~0) .cse13 .cse14 .cse22) (and .cse19 .cse0 .cse23 .cse2 .cse11 .cse3 .cse21 .cse4 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse19 .cse2 (= ~m_st~0 ~E_M~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22) (and .cse1 (= ~t1_pc~0 0) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse1 .cse2 .cse21 .cse4 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2022-11-03 01:42:11,604 INFO L895 garLoopResultBuilder]: At program point L654-1(lines 628 667) the Hoare annotation is: (let ((.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse20 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse2 .cse20 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse2 .cse20 .cse3 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse11 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11 .cse12))) [2022-11-03 01:42:11,604 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,604 INFO L895 garLoopResultBuilder]: At program point L522-1(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,604 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-03 01:42:11,604 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2022-11-03 01:42:11,605 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2022-11-03 01:42:11,605 INFO L895 garLoopResultBuilder]: At program point L1151(lines 1151 1160) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-03 01:42:11,605 INFO L899 garLoopResultBuilder]: For program point L1151-2(lines 1151 1160) no Hoare annotation was computed. [2022-11-03 01:42:11,605 INFO L899 garLoopResultBuilder]: For program point L887(lines 887 894) no Hoare annotation was computed. [2022-11-03 01:42:11,605 INFO L895 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (= ~p_dw_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0)) (and .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2))) [2022-11-03 01:42:11,606 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-03 01:42:11,606 INFO L895 garLoopResultBuilder]: At program point L492-1(line 492) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-03 01:42:11,606 INFO L895 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,606 INFO L895 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-03 01:42:11,606 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2022-11-03 01:42:11,607 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-03 01:42:11,607 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-03 01:42:11,607 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2022-11-03 01:42:11,607 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1194) no Hoare annotation was computed. [2022-11-03 01:42:11,607 INFO L895 garLoopResultBuilder]: At program point L1155(line 1155) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-03 01:42:11,608 INFO L895 garLoopResultBuilder]: At program point L1155-1(line 1155) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-03 01:42:11,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2022-11-03 01:42:11,608 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-03 01:42:11,608 INFO L895 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse17 (+ ~local~0 1))) (let ((.cse6 (= ~t2_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse9 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse10 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~t1_i~0 1)) (.cse11 (<= ~token~0 .cse17)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= .cse17 ~token~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse15 (= 0 ~t2_pc~0)) (.cse13 (= ~E_M~0 2)) (.cse16 (= 0 ~t2_st~0)) (.cse14 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse10 .cse3 (= 2 ~t2_st~0) .cse11 .cse5 .cse6 .cse12 .cse7 .cse8 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse15 .cse16 .cse9) (and .cse0 .cse2 .cse10 .cse3 .cse11 .cse5 .cse12 .cse7 .cse8 .cse15 .cse13 .cse16 .cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))))) [2022-11-03 01:42:11,608 INFO L899 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2022-11-03 01:42:11,609 INFO L895 garLoopResultBuilder]: At program point L1190(lines 1190 1193) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 01:42:11,609 INFO L895 garLoopResultBuilder]: At program point L662(lines 625 668) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (= ~t1_pc~0 0)) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse4 (= 2 ~t2_st~0)) (.cse8 (= ~t2_pc~0 1)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (<= 2 ~E_2~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse16 (= 0 ~t2_pc~0)) (.cse11 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse15 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse19 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse18 .cse19 .cse2 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15))) [2022-11-03 01:42:11,609 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 637) no Hoare annotation was computed. [2022-11-03 01:42:11,609 INFO L895 garLoopResultBuilder]: At program point L1125(line 1125) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 01:42:11,610 INFO L895 garLoopResultBuilder]: At program point L1125-1(line 1125) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-03 01:42:11,610 INFO L902 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: true [2022-11-03 01:42:11,610 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-11-03 01:42:11,610 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2022-11-03 01:42:11,610 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2022-11-03 01:42:11,610 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2022-11-03 01:42:11,610 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2022-11-03 01:42:11,611 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2022-11-03 01:42:11,611 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2022-11-03 01:42:11,611 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2022-11-03 01:42:11,611 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2022-11-03 01:42:11,611 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-11-03 01:42:11,611 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-11-03 01:42:11,611 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-11-03 01:42:11,612 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 829 853) the Hoare annotation is: true [2022-11-03 01:42:11,612 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 829 853) no Hoare annotation was computed. [2022-11-03 01:42:11,612 INFO L902 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: true [2022-11-03 01:42:11,612 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2022-11-03 01:42:11,613 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 957 994) the Hoare annotation is: (let ((.cse29 (= ~t2_pc~0 1)) (.cse27 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (= ~t1_i~0 1)) (.cse24 (= ~t1_pc~0 1)) (.cse25 (<= 2 ~E_1~0)) (.cse18 (<= |old(~E_2~0)| ~E_2~0)) (.cse31 (not (= ~m_st~0 0)))) (let ((.cse14 (not (= ~m_pc~0 0))) (.cse13 (not (= 2 |old(~E_1~0)|))) (.cse20 (= ~E_1~0 2)) (.cse16 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse31)) (.cse1 (and .cse25 .cse18)) (.cse7 (= ~m_pc~0 1)) (.cse8 (not (= ~m_st~0 2))) (.cse11 (not (= 0 ~t2_st~0))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse17 (not (= ~t1_st~0 0))) (.cse0 (not (<= 2 |old(~E_2~0)|))) (.cse2 (not (= ~t2_i~0 1))) (.cse3 (not .cse24)) (.cse21 (not (= 2 ~t2_st~0))) (.cse15 (not (= 2 |old(~E_M~0)|))) (.cse4 (not .cse26)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse22 (not (= 2 ~t1_st~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not .cse27)) (.cse28 (<= 2 ~E_2~0)) (.cse30 (= ~c_dr_pc~0 0)) (.cse23 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~E_M~0 2)) (.cse10 (not .cse29))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9 .cse12) (or .cse0 .cse2 (not (<= ~token~0 ~local~0)) .cse13 .cse14 .cse15 .cse4 .cse5 (not (= ~t1_pc~0 0)) (not (<= ~local~0 ~token~0)) .cse11 .cse9 .cse12 .cse16 .cse17 (and .cse18 .cse19 .cse20)) (or .cse0 .cse2 .cse3 .cse14 .cse21 .cse15 .cse4 .cse5 .cse22 .cse6 .cse9 (and .cse18 .cse23 .cse19) .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10) (or .cse0 .cse2 .cse3 .cse13 .cse21 .cse4 .cse5 .cse22 .cse6 .cse8 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse18 .cse30 .cse19 .cse20) .cse9 .cse16 .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9 .cse12 .cse17) (or .cse0 (not (< (+ ~local~0 1) ~token~0)) .cse2 .cse3 .cse21 .cse15 .cse4 .cse5 .cse22 .cse6 .cse9 .cse31 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse18 .cse30 .cse23 .cse19) .cse10 (not (<= ~token~0 (+ 2 ~local~0))))))) [2022-11-03 01:42:11,613 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 957 994) no Hoare annotation was computed. [2022-11-03 01:42:11,616 INFO L444 BasicCegarLoop]: Path program histogram: [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] [2022-11-03 01:42:11,618 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:42:11,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:42:11 BoogieIcfgContainer [2022-11-03 01:42:11,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:42:11,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:42:11,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:42:11,736 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:42:11,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:36:45" (3/4) ... [2022-11-03 01:42:11,739 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 01:42:11,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-03 01:42:11,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-11-03 01:42:11,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-03 01:42:11,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-11-03 01:42:11,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-03 01:42:11,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-03 01:42:11,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-11-03 01:42:11,746 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-03 01:42:11,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-03 01:42:11,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-03 01:42:11,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-03 01:42:11,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-03 01:42:11,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-11-03 01:42:11,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-03 01:42:11,758 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2022-11-03 01:42:11,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-03 01:42:11,760 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-03 01:42:11,761 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 01:42:11,787 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && c_dr_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || (((((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 1 <= __retres1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) [2022-11-03 01:42:11,790 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) && !(E_M == 1))) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) && !(tmp == 0)) [2022-11-03 01:42:11,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) [2022-11-03 01:42:11,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st) && __retres1 == 0)) && (((((((((((((!(t2_i == 1) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) || (((((((1 <= __retres1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1)) [2022-11-03 01:42:11,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) [2022-11-03 01:42:11,792 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && !(tmp == 0)) [2022-11-03 01:42:11,793 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) || !(t2_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 1 <= __retres1) && __retres1 == 0) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && __retres1 == 0) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) [2022-11-03 01:42:11,882 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:42:11,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:42:11,883 INFO L158 Benchmark]: Toolchain (without parser) took 328210.00ms. Allocated memory was 113.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 79.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 341.4MB. Max. memory is 16.1GB. [2022-11-03 01:42:11,884 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 64.3MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:42:11,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.91ms. Allocated memory is still 113.2MB. Free memory was 78.7MB in the beginning and 83.0MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:42:11,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.57ms. Allocated memory is still 113.2MB. Free memory was 83.0MB in the beginning and 79.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:42:11,887 INFO L158 Benchmark]: Boogie Preprocessor took 78.58ms. Allocated memory is still 113.2MB. Free memory was 79.7MB in the beginning and 77.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:42:11,887 INFO L158 Benchmark]: RCFGBuilder took 1121.25ms. Allocated memory is still 113.2MB. Free memory was 77.0MB in the beginning and 58.5MB in the end (delta: 18.6MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-11-03 01:42:11,889 INFO L158 Benchmark]: TraceAbstraction took 326137.96ms. Allocated memory was 113.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 58.2MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-03 01:42:11,890 INFO L158 Benchmark]: Witness Printer took 146.58ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 01:42:11,894 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.28ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 64.3MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.91ms. Allocated memory is still 113.2MB. Free memory was 78.7MB in the beginning and 83.0MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.57ms. Allocated memory is still 113.2MB. Free memory was 83.0MB in the beginning and 79.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.58ms. Allocated memory is still 113.2MB. Free memory was 79.7MB in the beginning and 77.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1121.25ms. Allocated memory is still 113.2MB. Free memory was 77.0MB in the beginning and 58.5MB in the end (delta: 18.6MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * TraceAbstraction took 326137.96ms. Allocated memory was 113.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 58.2MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 146.58ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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 15 procedures, 157 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 325.9s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 136.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8872 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8761 mSDsluCounter, 12416 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9805 mSDsCounter, 3724 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10875 IncrementalHoareTripleChecker+Invalid, 14599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3724 mSolverCounterUnsat, 4240 mSDtfsCounter, 10875 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3110 GetRequests, 2462 SyntacticMatches, 52 SemanticMatches, 596 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33350 ImplicationChecksByTransitivity, 96.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4038occurred in iteration=19, InterpolantAutomatonStates: 400, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 9034 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 9656 PreInvPairs, 10916 NumberOfFragments, 15759 HoareAnnotationTreeSize, 9656 FomulaSimplifications, 772411 FormulaSimplificationTreeSizeReduction, 80.2s HoareSimplificationTime, 81 FomulaSimplificationsInter, 1968175 FormulaSimplificationTreeSizeReductionInter, 55.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 4390 NumberOfCodeBlocks, 4306 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4680 ConstructedInterpolants, 0 QuantifiedInterpolants, 8880 SizeOfPredicates, 33 NumberOfNonLiveVariables, 8389 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 46 InterpolantComputations, 24 PerfectInterpolantSequences, 3084/3358 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 2 specifications checked. All of them hold - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: (((((((((((m_pc == t1_pc && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 471]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && !(2 == p_dw_pc)) - InvariantResult [Line: 1104]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0 - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1) && c_dr_pc == 0) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) && p_dw_pc == 1) - InvariantResult [Line: 1129]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: (((((((((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) || (((((((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 854]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(E_M == 1)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 782]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) || !(t2_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 1 <= __retres1) && __retres1 == 0) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && __retres1 == 0) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st) && __retres1 == 0)) && (((((((((((((!(t2_i == 1) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) || (((((((1 <= __retres1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2) && !(tmp == 0) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && c_dr_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || (((((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 1 <= __retres1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 1125]: Loop Invariant Derived loop invariant: (((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) && !(E_M == 1))) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) && !(tmp == 0)) RESULT: Ultimate proved your program to be correct! [2022-11-03 01:42:11,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa502df2-82f5-445e-90aa-0f01be24e1b5/bin/utaipan-7li7fVZpFI/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