./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57c8b47d74ada5c94291d16aafebbb644062493fff61510a323122bcd88ba5b1 --- 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-e04fb08 [2022-11-16 11:32:35,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:32:35,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:32:35,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:32:35,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:32:35,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:32:35,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:32:35,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:32:35,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:32:35,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:32:35,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:32:35,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:32:35,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:32:35,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:32:35,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:32:35,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:32:35,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:32:35,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:32:35,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:32:35,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:32:35,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:32:35,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:32:35,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:32:35,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:32:35,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:32:35,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:32:35,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:32:35,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:32:35,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:32:35,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:32:35,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:32:35,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:32:35,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:32:35,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:32:35,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:32:35,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:32:35,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:32:35,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:32:35,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:32:35,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:32:35,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:32:35,292 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:32:35,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:32:35,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:32:35,341 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:32:35,341 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:32:35,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:32:35,342 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:32:35,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:32:35,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:32:35,346 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:32:35,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:32:35,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:32:35,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:32:35,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:32:35,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:32:35,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:32:35,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:32:35,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:32:35,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:32:35,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:32:35,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:32:35,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:32:35,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:32:35,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:32:35,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:32:35,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:32:35,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:32:35,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:32:35,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:32:35,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:32:35,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:32:35,354 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:32:35,355 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:32:35,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:32:35,355 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_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/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_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57c8b47d74ada5c94291d16aafebbb644062493fff61510a323122bcd88ba5b1 [2022-11-16 11:32:35,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:32:35,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:32:35,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:32:35,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:32:35,697 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:32:35,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2022-11-16 11:32:35,785 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/data/47dc22e78/0db3c3e3691e4a4dba5fbb87f822509a/FLAGfc12a5dae [2022-11-16 11:32:36,364 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:32:36,365 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2022-11-16 11:32:36,380 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/data/47dc22e78/0db3c3e3691e4a4dba5fbb87f822509a/FLAGfc12a5dae [2022-11-16 11:32:36,678 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/data/47dc22e78/0db3c3e3691e4a4dba5fbb87f822509a [2022-11-16 11:32:36,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:32:36,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:32:36,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:32:36,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:32:36,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:32:36,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:32:36" (1/1) ... [2022-11-16 11:32:36,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5845ed7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:36, skipping insertion in model container [2022-11-16 11:32:36,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:32:36" (1/1) ... [2022-11-16 11:32:36,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:32:36,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:32:36,957 WARN L229 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_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i[994,1007] [2022-11-16 11:32:37,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:32:37,291 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:32:37,304 WARN L229 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_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i[994,1007] [2022-11-16 11:32:37,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:32:37,393 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:32:37,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37 WrapperNode [2022-11-16 11:32:37,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:32:37,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:32:37,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:32:37,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:32:37,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,450 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-11-16 11:32:37,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:32:37,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:32:37,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:32:37,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:32:37,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,489 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:32:37,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:32:37,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:32:37,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:32:37,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (1/1) ... [2022-11-16 11:32:37,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:32:37,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:32:37,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:32:37,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:32:37,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:32:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:32:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:32:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:32:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:32:37,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:32:37,615 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:32:37,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:32:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:32:37,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:32:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:32:37,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:32:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:32:37,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:32:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:32:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:32:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:32:37,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:32:37,621 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:32:37,794 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:32:37,796 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:32:38,493 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:32:38,968 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:32:38,969 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:32:38,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:32:38 BoogieIcfgContainer [2022-11-16 11:32:38,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:32:38,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:32:38,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:32:38,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:32:38,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:32:36" (1/3) ... [2022-11-16 11:32:38,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7057424b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:32:38, skipping insertion in model container [2022-11-16 11:32:38,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:32:37" (2/3) ... [2022-11-16 11:32:38,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7057424b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:32:38, skipping insertion in model container [2022-11-16 11:32:38,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:32:38" (3/3) ... [2022-11-16 11:32:38,982 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2022-11-16 11:32:38,991 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:32:39,002 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:32:39,002 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:32:39,002 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:32:39,110 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:32:39,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-11-16 11:32:39,260 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-16 11:32:39,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:32:39,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-11-16 11:32:39,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-11-16 11:32:39,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-11-16 11:32:39,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:32:39,286 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@11cade9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:32:39,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 11:32:39,303 INFO L130 PetriNetUnfolder]: 0/82 cut-off events. [2022-11-16 11:32:39,303 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:32:39,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:39,304 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:32:39,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:39,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1510569874, now seen corresponding path program 1 times [2022-11-16 11:32:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:39,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611782827] [2022-11-16 11:32:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:40,029 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-16 11:32:40,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:40,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611782827] [2022-11-16 11:32:40,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611782827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:40,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:40,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:32:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530518123] [2022-11-16 11:32:40,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:40,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:32:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:32:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:32:40,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 152 [2022-11-16 11:32:40,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 148 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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-16 11:32:40,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:40,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 152 [2022-11-16 11:32:40,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:40,705 INFO L130 PetriNetUnfolder]: 258/1462 cut-off events. [2022-11-16 11:32:40,705 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-16 11:32:40,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1462 events. 258/1462 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 11099 event pairs, 172 based on Foata normal form. 40/1403 useless extension candidates. Maximal degree in co-relation 1839. Up to 289 conditions per place. [2022-11-16 11:32:40,721 INFO L137 encePairwiseOnDemand]: 147/152 looper letters, 19 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2022-11-16 11:32:40,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 152 transitions, 364 flow [2022-11-16 11:32:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:32:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:32:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-11-16 11:32:40,736 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9451754385964912 [2022-11-16 11:32:40,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-11-16 11:32:40,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-11-16 11:32:40,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:40,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-11-16 11:32:40,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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-16 11:32:40,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 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-16 11:32:40,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 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-16 11:32:40,762 INFO L175 Difference]: Start difference. First operand has 159 places, 148 transitions, 308 flow. Second operand 3 states and 431 transitions. [2022-11-16 11:32:40,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 152 transitions, 364 flow [2022-11-16 11:32:40,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 152 transitions, 358 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:32:40,778 INFO L231 Difference]: Finished difference. Result has 155 places, 144 transitions, 300 flow [2022-11-16 11:32:40,780 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2022-11-16 11:32:40,784 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, -4 predicate places. [2022-11-16 11:32:40,785 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 300 flow [2022-11-16 11:32:40,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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-16 11:32:40,786 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:40,786 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:32:40,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:32:40,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1052725137, now seen corresponding path program 1 times [2022-11-16 11:32:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:40,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734787410] [2022-11-16 11:32:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:41,358 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-16 11:32:41,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:41,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734787410] [2022-11-16 11:32:41,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734787410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:41,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:41,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:32:41,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848465632] [2022-11-16 11:32:41,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:41,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:32:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:41,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:32:41,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:32:41,377 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 152 [2022-11-16 11:32:41,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 144 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 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-16 11:32:41,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:41,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 152 [2022-11-16 11:32:41,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:43,089 INFO L130 PetriNetUnfolder]: 1428/3792 cut-off events. [2022-11-16 11:32:43,090 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-11-16 11:32:43,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6149 conditions, 3792 events. 1428/3792 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 30755 event pairs, 741 based on Foata normal form. 0/3669 useless extension candidates. Maximal degree in co-relation 6074. Up to 1041 conditions per place. [2022-11-16 11:32:43,119 INFO L137 encePairwiseOnDemand]: 146/152 looper letters, 26 selfloop transitions, 2 changer transitions 59/198 dead transitions. [2022-11-16 11:32:43,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 198 transitions, 576 flow [2022-11-16 11:32:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:32:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:32:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1228 transitions. [2022-11-16 11:32:43,125 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8976608187134503 [2022-11-16 11:32:43,126 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1228 transitions. [2022-11-16 11:32:43,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1228 transitions. [2022-11-16 11:32:43,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:43,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1228 transitions. [2022-11-16 11:32:43,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 136.44444444444446) internal successors, (1228), 9 states have internal predecessors, (1228), 0 states have call successors, (0), 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-16 11:32:43,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 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-16 11:32:43,136 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 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-16 11:32:43,136 INFO L175 Difference]: Start difference. First operand has 155 places, 144 transitions, 300 flow. Second operand 9 states and 1228 transitions. [2022-11-16 11:32:43,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 198 transitions, 576 flow [2022-11-16 11:32:43,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 198 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:32:43,143 INFO L231 Difference]: Finished difference. Result has 168 places, 130 transitions, 288 flow [2022-11-16 11:32:43,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=168, PETRI_TRANSITIONS=130} [2022-11-16 11:32:43,144 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 9 predicate places. [2022-11-16 11:32:43,144 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 130 transitions, 288 flow [2022-11-16 11:32:43,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 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-16 11:32:43,145 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:43,146 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:32:43,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:32:43,146 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash -937844400, now seen corresponding path program 1 times [2022-11-16 11:32:43,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:43,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730804592] [2022-11-16 11:32:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:43,566 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-16 11:32:43,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:43,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730804592] [2022-11-16 11:32:43,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730804592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:43,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:43,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:32:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255124065] [2022-11-16 11:32:43,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:43,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:32:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:32:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:32:43,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 152 [2022-11-16 11:32:43,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 130 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 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-16 11:32:43,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:43,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 152 [2022-11-16 11:32:43,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:45,372 INFO L130 PetriNetUnfolder]: 2316/4240 cut-off events. [2022-11-16 11:32:45,372 INFO L131 PetriNetUnfolder]: For 861/861 co-relation queries the response was YES. [2022-11-16 11:32:45,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8632 conditions, 4240 events. 2316/4240 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 27647 event pairs, 474 based on Foata normal form. 72/4136 useless extension candidates. Maximal degree in co-relation 8549. Up to 1495 conditions per place. [2022-11-16 11:32:45,407 INFO L137 encePairwiseOnDemand]: 143/152 looper letters, 33 selfloop transitions, 5 changer transitions 53/199 dead transitions. [2022-11-16 11:32:45,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 199 transitions, 635 flow [2022-11-16 11:32:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:32:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:32:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1343 transitions. [2022-11-16 11:32:45,418 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8835526315789474 [2022-11-16 11:32:45,418 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1343 transitions. [2022-11-16 11:32:45,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1343 transitions. [2022-11-16 11:32:45,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:45,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1343 transitions. [2022-11-16 11:32:45,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.3) internal successors, (1343), 10 states have internal predecessors, (1343), 0 states have call successors, (0), 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-16 11:32:45,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 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-16 11:32:45,426 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 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-16 11:32:45,427 INFO L175 Difference]: Start difference. First operand has 168 places, 130 transitions, 288 flow. Second operand 10 states and 1343 transitions. [2022-11-16 11:32:45,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 199 transitions, 635 flow [2022-11-16 11:32:45,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 199 transitions, 601 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-16 11:32:45,480 INFO L231 Difference]: Finished difference. Result has 157 places, 132 transitions, 326 flow [2022-11-16 11:32:45,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=326, PETRI_PLACES=157, PETRI_TRANSITIONS=132} [2022-11-16 11:32:45,481 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, -2 predicate places. [2022-11-16 11:32:45,481 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 132 transitions, 326 flow [2022-11-16 11:32:45,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 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-16 11:32:45,482 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:45,483 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:32:45,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:32:45,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1059354613, now seen corresponding path program 1 times [2022-11-16 11:32:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:45,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828709616] [2022-11-16 11:32:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:46,040 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-16 11:32:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:46,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828709616] [2022-11-16 11:32:46,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828709616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:46,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:46,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:32:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986953431] [2022-11-16 11:32:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:46,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:32:46,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:46,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:32:46,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:32:46,044 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 152 [2022-11-16 11:32:46,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 132 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 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-16 11:32:46,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:46,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 152 [2022-11-16 11:32:46,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:47,107 INFO L130 PetriNetUnfolder]: 1100/2235 cut-off events. [2022-11-16 11:32:47,107 INFO L131 PetriNetUnfolder]: For 1778/1813 co-relation queries the response was YES. [2022-11-16 11:32:47,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5094 conditions, 2235 events. 1100/2235 cut-off events. For 1778/1813 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13820 event pairs, 381 based on Foata normal form. 48/2182 useless extension candidates. Maximal degree in co-relation 5007. Up to 882 conditions per place. [2022-11-16 11:32:47,129 INFO L137 encePairwiseOnDemand]: 145/152 looper letters, 22 selfloop transitions, 3 changer transitions 37/175 dead transitions. [2022-11-16 11:32:47,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 175 transitions, 560 flow [2022-11-16 11:32:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:32:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:32:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1344 transitions. [2022-11-16 11:32:47,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842105263157894 [2022-11-16 11:32:47,138 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1344 transitions. [2022-11-16 11:32:47,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1344 transitions. [2022-11-16 11:32:47,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:47,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1344 transitions. [2022-11-16 11:32:47,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.4) internal successors, (1344), 10 states have internal predecessors, (1344), 0 states have call successors, (0), 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-16 11:32:47,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 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-16 11:32:47,148 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 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-16 11:32:47,148 INFO L175 Difference]: Start difference. First operand has 157 places, 132 transitions, 326 flow. Second operand 10 states and 1344 transitions. [2022-11-16 11:32:47,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 175 transitions, 560 flow [2022-11-16 11:32:47,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 175 transitions, 535 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-16 11:32:47,161 INFO L231 Difference]: Finished difference. Result has 162 places, 132 transitions, 333 flow [2022-11-16 11:32:47,162 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=333, PETRI_PLACES=162, PETRI_TRANSITIONS=132} [2022-11-16 11:32:47,163 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2022-11-16 11:32:47,163 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 132 transitions, 333 flow [2022-11-16 11:32:47,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 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-16 11:32:47,164 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:47,164 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:32:47,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:32:47,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash -217023461, now seen corresponding path program 1 times [2022-11-16 11:32:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:47,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311730245] [2022-11-16 11:32:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:47,586 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-16 11:32:47,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:47,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311730245] [2022-11-16 11:32:47,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311730245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:47,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:47,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:32:47,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698300387] [2022-11-16 11:32:47,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:47,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:32:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:32:47,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:32:47,590 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 152 [2022-11-16 11:32:47,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 132 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 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-16 11:32:47,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:47,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 152 [2022-11-16 11:32:47,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:49,554 INFO L130 PetriNetUnfolder]: 2156/4162 cut-off events. [2022-11-16 11:32:49,554 INFO L131 PetriNetUnfolder]: For 3876/3900 co-relation queries the response was YES. [2022-11-16 11:32:49,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9768 conditions, 4162 events. 2156/4162 cut-off events. For 3876/3900 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 29091 event pairs, 606 based on Foata normal form. 84/4098 useless extension candidates. Maximal degree in co-relation 9677. Up to 1016 conditions per place. [2022-11-16 11:32:49,596 INFO L137 encePairwiseOnDemand]: 145/152 looper letters, 32 selfloop transitions, 3 changer transitions 75/218 dead transitions. [2022-11-16 11:32:49,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 218 transitions, 835 flow [2022-11-16 11:32:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:32:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:32:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1862 transitions. [2022-11-16 11:32:49,604 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-11-16 11:32:49,604 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1862 transitions. [2022-11-16 11:32:49,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1862 transitions. [2022-11-16 11:32:49,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:49,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1862 transitions. [2022-11-16 11:32:49,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 0 states have call successors, (0), 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-16 11:32:49,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 152.0) internal successors, (2280), 15 states have internal predecessors, (2280), 0 states have call successors, (0), 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-16 11:32:49,618 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 152.0) internal successors, (2280), 15 states have internal predecessors, (2280), 0 states have call successors, (0), 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-16 11:32:49,618 INFO L175 Difference]: Start difference. First operand has 162 places, 132 transitions, 333 flow. Second operand 14 states and 1862 transitions. [2022-11-16 11:32:49,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 218 transitions, 835 flow [2022-11-16 11:32:49,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 218 transitions, 771 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-11-16 11:32:49,654 INFO L231 Difference]: Finished difference. Result has 172 places, 132 transitions, 348 flow [2022-11-16 11:32:49,654 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=348, PETRI_PLACES=172, PETRI_TRANSITIONS=132} [2022-11-16 11:32:49,655 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 13 predicate places. [2022-11-16 11:32:49,655 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 132 transitions, 348 flow [2022-11-16 11:32:49,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 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-16 11:32:49,656 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:49,657 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:32:49,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:32:49,657 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 187723666, now seen corresponding path program 1 times [2022-11-16 11:32:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:49,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288776406] [2022-11-16 11:32:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:50,204 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-16 11:32:50,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:50,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288776406] [2022-11-16 11:32:50,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288776406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:50,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:50,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:32:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429238009] [2022-11-16 11:32:50,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:50,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:32:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:50,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:32:50,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:32:50,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 152 [2022-11-16 11:32:50,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 132 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 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-16 11:32:50,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:50,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 152 [2022-11-16 11:32:50,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:53,106 INFO L130 PetriNetUnfolder]: 8146/14098 cut-off events. [2022-11-16 11:32:53,106 INFO L131 PetriNetUnfolder]: For 5825/5913 co-relation queries the response was YES. [2022-11-16 11:32:53,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28881 conditions, 14098 events. 8146/14098 cut-off events. For 5825/5913 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 109610 event pairs, 366 based on Foata normal form. 0/13619 useless extension candidates. Maximal degree in co-relation 28787. Up to 4975 conditions per place. [2022-11-16 11:32:53,230 INFO L137 encePairwiseOnDemand]: 141/152 looper letters, 38 selfloop transitions, 7 changer transitions 60/213 dead transitions. [2022-11-16 11:32:53,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 213 transitions, 731 flow [2022-11-16 11:32:53,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:32:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:32:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1347 transitions. [2022-11-16 11:32:53,234 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8861842105263158 [2022-11-16 11:32:53,235 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1347 transitions. [2022-11-16 11:32:53,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1347 transitions. [2022-11-16 11:32:53,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:53,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1347 transitions. [2022-11-16 11:32:53,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.7) internal successors, (1347), 10 states have internal predecessors, (1347), 0 states have call successors, (0), 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-16 11:32:53,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 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-16 11:32:53,243 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 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-16 11:32:53,243 INFO L175 Difference]: Start difference. First operand has 172 places, 132 transitions, 348 flow. Second operand 10 states and 1347 transitions. [2022-11-16 11:32:53,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 213 transitions, 731 flow [2022-11-16 11:32:53,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 213 transitions, 700 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-11-16 11:32:53,302 INFO L231 Difference]: Finished difference. Result has 164 places, 135 transitions, 383 flow [2022-11-16 11:32:53,302 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=383, PETRI_PLACES=164, PETRI_TRANSITIONS=135} [2022-11-16 11:32:53,303 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 5 predicate places. [2022-11-16 11:32:53,303 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 135 transitions, 383 flow [2022-11-16 11:32:53,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 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-16 11:32:53,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:53,304 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:32:53,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:32:53,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -790686163, now seen corresponding path program 1 times [2022-11-16 11:32:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:53,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613211252] [2022-11-16 11:32:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:32:53,907 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-16 11:32:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:32:53,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613211252] [2022-11-16 11:32:53,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613211252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:32:53,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:32:53,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:32:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286288354] [2022-11-16 11:32:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:32:53,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:32:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:32:53,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:32:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:32:53,911 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 152 [2022-11-16 11:32:53,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 135 transitions, 383 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 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-16 11:32:53,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:32:53,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 152 [2022-11-16 11:32:53,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:32:55,973 INFO L130 PetriNetUnfolder]: 3519/6680 cut-off events. [2022-11-16 11:32:55,973 INFO L131 PetriNetUnfolder]: For 8628/8739 co-relation queries the response was YES. [2022-11-16 11:32:56,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19637 conditions, 6680 events. 3519/6680 cut-off events. For 8628/8739 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 49563 event pairs, 194 based on Foata normal form. 209/6781 useless extension candidates. Maximal degree in co-relation 19546. Up to 1982 conditions per place. [2022-11-16 11:32:56,019 INFO L137 encePairwiseOnDemand]: 142/152 looper letters, 45 selfloop transitions, 11 changer transitions 47/211 dead transitions. [2022-11-16 11:32:56,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 211 transitions, 917 flow [2022-11-16 11:32:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:32:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:32:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1345 transitions. [2022-11-16 11:32:56,023 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8848684210526315 [2022-11-16 11:32:56,023 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1345 transitions. [2022-11-16 11:32:56,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1345 transitions. [2022-11-16 11:32:56,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:32:56,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1345 transitions. [2022-11-16 11:32:56,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.5) internal successors, (1345), 10 states have internal predecessors, (1345), 0 states have call successors, (0), 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-16 11:32:56,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 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-16 11:32:56,031 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 152.0) internal successors, (1672), 11 states have internal predecessors, (1672), 0 states have call successors, (0), 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-16 11:32:56,032 INFO L175 Difference]: Start difference. First operand has 164 places, 135 transitions, 383 flow. Second operand 10 states and 1345 transitions. [2022-11-16 11:32:56,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 211 transitions, 917 flow [2022-11-16 11:32:56,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 211 transitions, 892 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-16 11:32:56,068 INFO L231 Difference]: Finished difference. Result has 168 places, 139 transitions, 471 flow [2022-11-16 11:32:56,069 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=471, PETRI_PLACES=168, PETRI_TRANSITIONS=139} [2022-11-16 11:32:56,070 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 9 predicate places. [2022-11-16 11:32:56,070 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 139 transitions, 471 flow [2022-11-16 11:32:56,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 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-16 11:32:56,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:32:56,071 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:32:56,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:32:56,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:32:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:32:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 932238654, now seen corresponding path program 1 times [2022-11-16 11:32:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:32:56,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739371688] [2022-11-16 11:32:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:32:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:32:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:00,445 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-16 11:33:00,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:00,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739371688] [2022-11-16 11:33:00,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739371688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:00,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:00,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-16 11:33:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118354350] [2022-11-16 11:33:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:00,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:33:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:00,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:33:00,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:33:00,449 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 152 [2022-11-16 11:33:00,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 139 transitions, 471 flow. Second operand has 18 states, 18 states have (on average 110.94444444444444) internal successors, (1997), 18 states have internal predecessors, (1997), 0 states have call successors, (0), 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-16 11:33:00,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:00,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 152 [2022-11-16 11:33:00,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:02,335 INFO L130 PetriNetUnfolder]: 874/2687 cut-off events. [2022-11-16 11:33:02,336 INFO L131 PetriNetUnfolder]: For 5617/6007 co-relation queries the response was YES. [2022-11-16 11:33:02,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7895 conditions, 2687 events. 874/2687 cut-off events. For 5617/6007 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 22076 event pairs, 289 based on Foata normal form. 35/2590 useless extension candidates. Maximal degree in co-relation 7783. Up to 826 conditions per place. [2022-11-16 11:33:02,370 INFO L137 encePairwiseOnDemand]: 134/152 looper letters, 54 selfloop transitions, 16 changer transitions 29/200 dead transitions. [2022-11-16 11:33:02,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 200 transitions, 853 flow [2022-11-16 11:33:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:33:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-16 11:33:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2609 transitions. [2022-11-16 11:33:02,378 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7462814645308925 [2022-11-16 11:33:02,378 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2609 transitions. [2022-11-16 11:33:02,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2609 transitions. [2022-11-16 11:33:02,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:02,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2609 transitions. [2022-11-16 11:33:02,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 113.43478260869566) internal successors, (2609), 23 states have internal predecessors, (2609), 0 states have call successors, (0), 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-16 11:33:02,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 152.0) internal successors, (3648), 24 states have internal predecessors, (3648), 0 states have call successors, (0), 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-16 11:33:02,398 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 152.0) internal successors, (3648), 24 states have internal predecessors, (3648), 0 states have call successors, (0), 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-16 11:33:02,398 INFO L175 Difference]: Start difference. First operand has 168 places, 139 transitions, 471 flow. Second operand 23 states and 2609 transitions. [2022-11-16 11:33:02,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 200 transitions, 853 flow [2022-11-16 11:33:02,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 200 transitions, 784 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-11-16 11:33:02,433 INFO L231 Difference]: Finished difference. Result has 190 places, 145 transitions, 500 flow [2022-11-16 11:33:02,434 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=500, PETRI_PLACES=190, PETRI_TRANSITIONS=145} [2022-11-16 11:33:02,437 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 31 predicate places. [2022-11-16 11:33:02,438 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 145 transitions, 500 flow [2022-11-16 11:33:02,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 110.94444444444444) internal successors, (1997), 18 states have internal predecessors, (1997), 0 states have call successors, (0), 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-16 11:33:02,439 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:02,439 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:02,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:33:02,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash 887197630, now seen corresponding path program 2 times [2022-11-16 11:33:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:02,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370321823] [2022-11-16 11:33:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:05,471 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-16 11:33:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:05,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370321823] [2022-11-16 11:33:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370321823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:05,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:05,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-16 11:33:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048437302] [2022-11-16 11:33:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:33:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:33:05,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:33:05,475 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 152 [2022-11-16 11:33:05,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 145 transitions, 500 flow. Second operand has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-16 11:33:05,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:05,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 152 [2022-11-16 11:33:05,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:07,284 INFO L130 PetriNetUnfolder]: 926/2848 cut-off events. [2022-11-16 11:33:07,285 INFO L131 PetriNetUnfolder]: For 7207/7411 co-relation queries the response was YES. [2022-11-16 11:33:07,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8984 conditions, 2848 events. 926/2848 cut-off events. For 7207/7411 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 23581 event pairs, 341 based on Foata normal form. 48/2779 useless extension candidates. Maximal degree in co-relation 8860. Up to 812 conditions per place. [2022-11-16 11:33:07,329 INFO L137 encePairwiseOnDemand]: 135/152 looper letters, 51 selfloop transitions, 27 changer transitions 35/217 dead transitions. [2022-11-16 11:33:07,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 217 transitions, 1218 flow [2022-11-16 11:33:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:33:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-16 11:33:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2910 transitions. [2022-11-16 11:33:07,337 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7657894736842106 [2022-11-16 11:33:07,338 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2910 transitions. [2022-11-16 11:33:07,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2910 transitions. [2022-11-16 11:33:07,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:07,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2910 transitions. [2022-11-16 11:33:07,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 116.4) internal successors, (2910), 25 states have internal predecessors, (2910), 0 states have call successors, (0), 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-16 11:33:07,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 152.0) internal successors, (3952), 26 states have internal predecessors, (3952), 0 states have call successors, (0), 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-16 11:33:07,356 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 152.0) internal successors, (3952), 26 states have internal predecessors, (3952), 0 states have call successors, (0), 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-16 11:33:07,356 INFO L175 Difference]: Start difference. First operand has 190 places, 145 transitions, 500 flow. Second operand 25 states and 2910 transitions. [2022-11-16 11:33:07,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 217 transitions, 1218 flow [2022-11-16 11:33:07,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 217 transitions, 1132 flow, removed 28 selfloop flow, removed 15 redundant places. [2022-11-16 11:33:07,375 INFO L231 Difference]: Finished difference. Result has 207 places, 161 transitions, 705 flow [2022-11-16 11:33:07,375 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=705, PETRI_PLACES=207, PETRI_TRANSITIONS=161} [2022-11-16 11:33:07,376 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 48 predicate places. [2022-11-16 11:33:07,376 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 161 transitions, 705 flow [2022-11-16 11:33:07,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 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-16 11:33:07,378 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:07,378 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:07,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:33:07,379 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash -554756436, now seen corresponding path program 3 times [2022-11-16 11:33:07,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:07,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867413229] [2022-11-16 11:33:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:10,991 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-16 11:33:10,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867413229] [2022-11-16 11:33:10,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867413229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:10,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:10,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-16 11:33:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121619799] [2022-11-16 11:33:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:10,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:33:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:33:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:33:10,996 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 152 [2022-11-16 11:33:10,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 161 transitions, 705 flow. Second operand has 23 states, 23 states have (on average 95.82608695652173) internal successors, (2204), 23 states have internal predecessors, (2204), 0 states have call successors, (0), 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-16 11:33:10,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:10,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 152 [2022-11-16 11:33:10,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:13,605 INFO L130 PetriNetUnfolder]: 959/3033 cut-off events. [2022-11-16 11:33:13,605 INFO L131 PetriNetUnfolder]: For 12476/12651 co-relation queries the response was YES. [2022-11-16 11:33:13,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10644 conditions, 3033 events. 959/3033 cut-off events. For 12476/12651 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 25287 event pairs, 472 based on Foata normal form. 75/2990 useless extension candidates. Maximal degree in co-relation 10503. Up to 887 conditions per place. [2022-11-16 11:33:13,635 INFO L137 encePairwiseOnDemand]: 129/152 looper letters, 69 selfloop transitions, 46 changer transitions 35/244 dead transitions. [2022-11-16 11:33:13,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 244 transitions, 1729 flow [2022-11-16 11:33:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:33:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-11-16 11:33:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3332 transitions. [2022-11-16 11:33:13,645 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6447368421052632 [2022-11-16 11:33:13,645 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3332 transitions. [2022-11-16 11:33:13,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3332 transitions. [2022-11-16 11:33:13,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:13,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3332 transitions. [2022-11-16 11:33:13,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 98.0) internal successors, (3332), 34 states have internal predecessors, (3332), 0 states have call successors, (0), 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-16 11:33:13,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 152.0) internal successors, (5320), 35 states have internal predecessors, (5320), 0 states have call successors, (0), 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-16 11:33:13,663 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 152.0) internal successors, (5320), 35 states have internal predecessors, (5320), 0 states have call successors, (0), 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-16 11:33:13,663 INFO L175 Difference]: Start difference. First operand has 207 places, 161 transitions, 705 flow. Second operand 34 states and 3332 transitions. [2022-11-16 11:33:13,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 244 transitions, 1729 flow [2022-11-16 11:33:13,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 244 transitions, 1520 flow, removed 99 selfloop flow, removed 18 redundant places. [2022-11-16 11:33:13,703 INFO L231 Difference]: Finished difference. Result has 231 places, 188 transitions, 1007 flow [2022-11-16 11:33:13,704 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1007, PETRI_PLACES=231, PETRI_TRANSITIONS=188} [2022-11-16 11:33:13,704 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 72 predicate places. [2022-11-16 11:33:13,704 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 188 transitions, 1007 flow [2022-11-16 11:33:13,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 95.82608695652173) internal successors, (2204), 23 states have internal predecessors, (2204), 0 states have call successors, (0), 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-16 11:33:13,706 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:13,706 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:13,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:33:13,706 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:13,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash -31694526, now seen corresponding path program 1 times [2022-11-16 11:33:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:13,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342519776] [2022-11-16 11:33:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:14,068 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-16 11:33:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:14,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342519776] [2022-11-16 11:33:14,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342519776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:14,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:14,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:33:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118733159] [2022-11-16 11:33:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:14,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:33:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:33:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:33:14,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 152 [2022-11-16 11:33:14,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 188 transitions, 1007 flow. Second operand has 8 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 0 states have call successors, (0), 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-16 11:33:14,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:14,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 152 [2022-11-16 11:33:14,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:15,512 INFO L130 PetriNetUnfolder]: 1658/3623 cut-off events. [2022-11-16 11:33:15,512 INFO L131 PetriNetUnfolder]: For 16792/16929 co-relation queries the response was YES. [2022-11-16 11:33:15,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14551 conditions, 3623 events. 1658/3623 cut-off events. For 16792/16929 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 26261 event pairs, 87 based on Foata normal form. 119/3678 useless extension candidates. Maximal degree in co-relation 14417. Up to 747 conditions per place. [2022-11-16 11:33:15,548 INFO L137 encePairwiseOnDemand]: 142/152 looper letters, 129 selfloop transitions, 15 changer transitions 99/358 dead transitions. [2022-11-16 11:33:15,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 358 transitions, 3057 flow [2022-11-16 11:33:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:33:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:33:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1479 transitions. [2022-11-16 11:33:15,559 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8845693779904307 [2022-11-16 11:33:15,559 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1479 transitions. [2022-11-16 11:33:15,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1479 transitions. [2022-11-16 11:33:15,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:15,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1479 transitions. [2022-11-16 11:33:15,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.45454545454547) internal successors, (1479), 11 states have internal predecessors, (1479), 0 states have call successors, (0), 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-16 11:33:15,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 152.0) internal successors, (1824), 12 states have internal predecessors, (1824), 0 states have call successors, (0), 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-16 11:33:15,567 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 152.0) internal successors, (1824), 12 states have internal predecessors, (1824), 0 states have call successors, (0), 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-16 11:33:15,567 INFO L175 Difference]: Start difference. First operand has 231 places, 188 transitions, 1007 flow. Second operand 11 states and 1479 transitions. [2022-11-16 11:33:15,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 358 transitions, 3057 flow [2022-11-16 11:33:15,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 358 transitions, 2724 flow, removed 129 selfloop flow, removed 25 redundant places. [2022-11-16 11:33:15,614 INFO L231 Difference]: Finished difference. Result has 210 places, 189 transitions, 963 flow [2022-11-16 11:33:15,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=963, PETRI_PLACES=210, PETRI_TRANSITIONS=189} [2022-11-16 11:33:15,615 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 51 predicate places. [2022-11-16 11:33:15,616 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 189 transitions, 963 flow [2022-11-16 11:33:15,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 0 states have call successors, (0), 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-16 11:33:15,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:15,617 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:15,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:33:15,617 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1112374013, now seen corresponding path program 1 times [2022-11-16 11:33:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:15,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568224781] [2022-11-16 11:33:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:15,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:20,351 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-16 11:33:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:20,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568224781] [2022-11-16 11:33:20,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568224781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:20,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:20,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-16 11:33:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357997244] [2022-11-16 11:33:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:20,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:33:20,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:33:20,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:33:20,356 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 152 [2022-11-16 11:33:20,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 189 transitions, 963 flow. Second operand has 23 states, 23 states have (on average 96.82608695652173) internal successors, (2227), 23 states have internal predecessors, (2227), 0 states have call successors, (0), 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-16 11:33:20,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:20,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 152 [2022-11-16 11:33:20,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:22,324 INFO L130 PetriNetUnfolder]: 442/1699 cut-off events. [2022-11-16 11:33:22,325 INFO L131 PetriNetUnfolder]: For 5961/6139 co-relation queries the response was YES. [2022-11-16 11:33:22,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 1699 events. 442/1699 cut-off events. For 5961/6139 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12938 event pairs, 136 based on Foata normal form. 79/1722 useless extension candidates. Maximal degree in co-relation 5627. Up to 401 conditions per place. [2022-11-16 11:33:22,341 INFO L137 encePairwiseOnDemand]: 130/152 looper letters, 81 selfloop transitions, 44 changer transitions 17/241 dead transitions. [2022-11-16 11:33:22,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 241 transitions, 1604 flow [2022-11-16 11:33:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:33:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-11-16 11:33:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2668 transitions. [2022-11-16 11:33:22,354 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6500974658869396 [2022-11-16 11:33:22,355 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2668 transitions. [2022-11-16 11:33:22,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2668 transitions. [2022-11-16 11:33:22,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:22,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2668 transitions. [2022-11-16 11:33:22,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 98.81481481481481) internal successors, (2668), 27 states have internal predecessors, (2668), 0 states have call successors, (0), 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-16 11:33:22,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 152.0) internal successors, (4256), 28 states have internal predecessors, (4256), 0 states have call successors, (0), 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-16 11:33:22,370 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 152.0) internal successors, (4256), 28 states have internal predecessors, (4256), 0 states have call successors, (0), 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-16 11:33:22,371 INFO L175 Difference]: Start difference. First operand has 210 places, 189 transitions, 963 flow. Second operand 27 states and 2668 transitions. [2022-11-16 11:33:22,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 241 transitions, 1604 flow [2022-11-16 11:33:22,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 241 transitions, 1519 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-11-16 11:33:22,409 INFO L231 Difference]: Finished difference. Result has 235 places, 205 transitions, 1171 flow [2022-11-16 11:33:22,409 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1171, PETRI_PLACES=235, PETRI_TRANSITIONS=205} [2022-11-16 11:33:22,410 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 76 predicate places. [2022-11-16 11:33:22,410 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 205 transitions, 1171 flow [2022-11-16 11:33:22,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 96.82608695652173) internal successors, (2227), 23 states have internal predecessors, (2227), 0 states have call successors, (0), 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-16 11:33:22,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:22,412 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:22,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:33:22,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1427895135, now seen corresponding path program 2 times [2022-11-16 11:33:22,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:22,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233994569] [2022-11-16 11:33:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:27,284 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-16 11:33:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:27,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233994569] [2022-11-16 11:33:27,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233994569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:27,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:27,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-11-16 11:33:27,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109470032] [2022-11-16 11:33:27,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:27,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 11:33:27,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 11:33:27,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-11-16 11:33:27,289 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 152 [2022-11-16 11:33:27,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 205 transitions, 1171 flow. Second operand has 27 states, 27 states have (on average 92.70370370370371) internal successors, (2503), 27 states have internal predecessors, (2503), 0 states have call successors, (0), 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-16 11:33:27,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:27,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 152 [2022-11-16 11:33:27,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:29,981 INFO L130 PetriNetUnfolder]: 495/1946 cut-off events. [2022-11-16 11:33:29,982 INFO L131 PetriNetUnfolder]: For 7726/7886 co-relation queries the response was YES. [2022-11-16 11:33:29,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6313 conditions, 1946 events. 495/1946 cut-off events. For 7726/7886 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15773 event pairs, 137 based on Foata normal form. 102/1989 useless extension candidates. Maximal degree in co-relation 6156. Up to 363 conditions per place. [2022-11-16 11:33:30,000 INFO L137 encePairwiseOnDemand]: 127/152 looper letters, 75 selfloop transitions, 64 changer transitions 17/251 dead transitions. [2022-11-16 11:33:30,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 251 transitions, 1934 flow [2022-11-16 11:33:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:33:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-11-16 11:33:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3212 transitions. [2022-11-16 11:33:30,008 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.621517027863777 [2022-11-16 11:33:30,008 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3212 transitions. [2022-11-16 11:33:30,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3212 transitions. [2022-11-16 11:33:30,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:30,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3212 transitions. [2022-11-16 11:33:30,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 94.47058823529412) internal successors, (3212), 34 states have internal predecessors, (3212), 0 states have call successors, (0), 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-16 11:33:30,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 152.0) internal successors, (5320), 35 states have internal predecessors, (5320), 0 states have call successors, (0), 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-16 11:33:30,026 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 152.0) internal successors, (5320), 35 states have internal predecessors, (5320), 0 states have call successors, (0), 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-16 11:33:30,026 INFO L175 Difference]: Start difference. First operand has 235 places, 205 transitions, 1171 flow. Second operand 34 states and 3212 transitions. [2022-11-16 11:33:30,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 251 transitions, 1934 flow [2022-11-16 11:33:30,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 251 transitions, 1754 flow, removed 76 selfloop flow, removed 20 redundant places. [2022-11-16 11:33:30,065 INFO L231 Difference]: Finished difference. Result has 253 places, 214 transitions, 1406 flow [2022-11-16 11:33:30,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1406, PETRI_PLACES=253, PETRI_TRANSITIONS=214} [2022-11-16 11:33:30,066 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 94 predicate places. [2022-11-16 11:33:30,066 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 214 transitions, 1406 flow [2022-11-16 11:33:30,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 92.70370370370371) internal successors, (2503), 27 states have internal predecessors, (2503), 0 states have call successors, (0), 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-16 11:33:30,067 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:30,067 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:30,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:33:30,068 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 697611241, now seen corresponding path program 3 times [2022-11-16 11:33:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:30,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203015686] [2022-11-16 11:33:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:33,292 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-16 11:33:33,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:33,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203015686] [2022-11-16 11:33:33,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203015686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:33,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:33,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-16 11:33:33,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255710018] [2022-11-16 11:33:33,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:33,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:33:33,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:33,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:33:33,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:33:33,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 152 [2022-11-16 11:33:33,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 214 transitions, 1406 flow. Second operand has 19 states, 19 states have (on average 109.94736842105263) internal successors, (2089), 19 states have internal predecessors, (2089), 0 states have call successors, (0), 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-16 11:33:33,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:33,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 152 [2022-11-16 11:33:33,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:34,766 INFO L130 PetriNetUnfolder]: 526/2095 cut-off events. [2022-11-16 11:33:34,766 INFO L131 PetriNetUnfolder]: For 8062/8241 co-relation queries the response was YES. [2022-11-16 11:33:34,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6823 conditions, 2095 events. 526/2095 cut-off events. For 8062/8241 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17722 event pairs, 128 based on Foata normal form. 110/2149 useless extension candidates. Maximal degree in co-relation 6662. Up to 458 conditions per place. [2022-11-16 11:33:34,786 INFO L137 encePairwiseOnDemand]: 132/152 looper letters, 83 selfloop transitions, 54 changer transitions 19/264 dead transitions. [2022-11-16 11:33:34,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 264 transitions, 2185 flow [2022-11-16 11:33:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:33:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-16 11:33:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2683 transitions. [2022-11-16 11:33:34,792 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7354714912280702 [2022-11-16 11:33:34,792 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2683 transitions. [2022-11-16 11:33:34,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2683 transitions. [2022-11-16 11:33:34,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:34,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2683 transitions. [2022-11-16 11:33:34,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 111.79166666666667) internal successors, (2683), 24 states have internal predecessors, (2683), 0 states have call successors, (0), 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-16 11:33:34,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 152.0) internal successors, (3800), 25 states have internal predecessors, (3800), 0 states have call successors, (0), 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-16 11:33:34,806 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 152.0) internal successors, (3800), 25 states have internal predecessors, (3800), 0 states have call successors, (0), 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-16 11:33:34,807 INFO L175 Difference]: Start difference. First operand has 253 places, 214 transitions, 1406 flow. Second operand 24 states and 2683 transitions. [2022-11-16 11:33:34,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 264 transitions, 2185 flow [2022-11-16 11:33:34,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 264 transitions, 2021 flow, removed 63 selfloop flow, removed 25 redundant places. [2022-11-16 11:33:34,860 INFO L231 Difference]: Finished difference. Result has 254 places, 230 transitions, 1633 flow [2022-11-16 11:33:34,860 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1633, PETRI_PLACES=254, PETRI_TRANSITIONS=230} [2022-11-16 11:33:34,861 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 95 predicate places. [2022-11-16 11:33:34,861 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 230 transitions, 1633 flow [2022-11-16 11:33:34,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 109.94736842105263) internal successors, (2089), 19 states have internal predecessors, (2089), 0 states have call successors, (0), 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-16 11:33:34,863 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:34,863 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:34,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:33:34,863 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1171827437, now seen corresponding path program 4 times [2022-11-16 11:33:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:34,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023437296] [2022-11-16 11:33:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:37,926 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-16 11:33:37,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:37,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023437296] [2022-11-16 11:33:37,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023437296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:37,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:37,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-16 11:33:37,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914201337] [2022-11-16 11:33:37,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:37,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:33:37,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:33:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:33:37,931 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 152 [2022-11-16 11:33:37,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 230 transitions, 1633 flow. Second operand has 18 states, 18 states have (on average 112.88888888888889) internal successors, (2032), 18 states have internal predecessors, (2032), 0 states have call successors, (0), 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-16 11:33:37,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:37,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 152 [2022-11-16 11:33:37,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:39,463 INFO L130 PetriNetUnfolder]: 545/2178 cut-off events. [2022-11-16 11:33:39,463 INFO L131 PetriNetUnfolder]: For 10173/10417 co-relation queries the response was YES. [2022-11-16 11:33:39,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 2178 events. 545/2178 cut-off events. For 10173/10417 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18694 event pairs, 131 based on Foata normal form. 125/2242 useless extension candidates. Maximal degree in co-relation 7273. Up to 429 conditions per place. [2022-11-16 11:33:39,484 INFO L137 encePairwiseOnDemand]: 134/152 looper letters, 66 selfloop transitions, 73 changer transitions 18/268 dead transitions. [2022-11-16 11:33:39,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 268 transitions, 2365 flow [2022-11-16 11:33:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:33:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-16 11:33:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2639 transitions. [2022-11-16 11:33:39,501 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.754862700228833 [2022-11-16 11:33:39,501 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2639 transitions. [2022-11-16 11:33:39,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2639 transitions. [2022-11-16 11:33:39,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:39,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2639 transitions. [2022-11-16 11:33:39,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 114.73913043478261) internal successors, (2639), 23 states have internal predecessors, (2639), 0 states have call successors, (0), 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-16 11:33:39,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 152.0) internal successors, (3648), 24 states have internal predecessors, (3648), 0 states have call successors, (0), 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-16 11:33:39,521 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 152.0) internal successors, (3648), 24 states have internal predecessors, (3648), 0 states have call successors, (0), 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-16 11:33:39,522 INFO L175 Difference]: Start difference. First operand has 254 places, 230 transitions, 1633 flow. Second operand 23 states and 2639 transitions. [2022-11-16 11:33:39,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 268 transitions, 2365 flow [2022-11-16 11:33:39,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 268 transitions, 2244 flow, removed 53 selfloop flow, removed 17 redundant places. [2022-11-16 11:33:39,594 INFO L231 Difference]: Finished difference. Result has 263 places, 240 transitions, 1959 flow [2022-11-16 11:33:39,595 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1959, PETRI_PLACES=263, PETRI_TRANSITIONS=240} [2022-11-16 11:33:39,596 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 104 predicate places. [2022-11-16 11:33:39,596 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 240 transitions, 1959 flow [2022-11-16 11:33:39,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 112.88888888888889) internal successors, (2032), 18 states have internal predecessors, (2032), 0 states have call successors, (0), 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-16 11:33:39,597 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:39,598 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:39,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:33:39,598 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1888411327, now seen corresponding path program 1 times [2022-11-16 11:33:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:39,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586295187] [2022-11-16 11:33:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:41,506 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-16 11:33:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:41,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586295187] [2022-11-16 11:33:41,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586295187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:41,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:41,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:33:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938052887] [2022-11-16 11:33:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:41,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:33:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:41,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:33:41,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:33:41,511 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 152 [2022-11-16 11:33:41,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 240 transitions, 1959 flow. Second operand has 14 states, 14 states have (on average 113.5) internal successors, (1589), 14 states have internal predecessors, (1589), 0 states have call successors, (0), 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-16 11:33:41,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:41,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 152 [2022-11-16 11:33:41,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:43,093 INFO L130 PetriNetUnfolder]: 772/3116 cut-off events. [2022-11-16 11:33:43,093 INFO L131 PetriNetUnfolder]: For 15452/15805 co-relation queries the response was YES. [2022-11-16 11:33:43,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10769 conditions, 3116 events. 772/3116 cut-off events. For 15452/15805 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 29348 event pairs, 169 based on Foata normal form. 192/3206 useless extension candidates. Maximal degree in co-relation 10606. Up to 456 conditions per place. [2022-11-16 11:33:43,128 INFO L137 encePairwiseOnDemand]: 139/152 looper letters, 107 selfloop transitions, 67 changer transitions 10/295 dead transitions. [2022-11-16 11:33:43,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 295 transitions, 2870 flow [2022-11-16 11:33:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:33:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:33:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1756 transitions. [2022-11-16 11:33:43,132 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7701754385964912 [2022-11-16 11:33:43,132 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1756 transitions. [2022-11-16 11:33:43,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1756 transitions. [2022-11-16 11:33:43,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:43,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1756 transitions. [2022-11-16 11:33:43,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 117.06666666666666) internal successors, (1756), 15 states have internal predecessors, (1756), 0 states have call successors, (0), 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-16 11:33:43,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 152.0) internal successors, (2432), 16 states have internal predecessors, (2432), 0 states have call successors, (0), 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-16 11:33:43,148 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 152.0) internal successors, (2432), 16 states have internal predecessors, (2432), 0 states have call successors, (0), 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-16 11:33:43,149 INFO L175 Difference]: Start difference. First operand has 263 places, 240 transitions, 1959 flow. Second operand 15 states and 1756 transitions. [2022-11-16 11:33:43,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 295 transitions, 2870 flow [2022-11-16 11:33:43,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 295 transitions, 2714 flow, removed 70 selfloop flow, removed 17 redundant places. [2022-11-16 11:33:43,247 INFO L231 Difference]: Finished difference. Result has 260 places, 250 transitions, 2241 flow [2022-11-16 11:33:43,248 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2241, PETRI_PLACES=260, PETRI_TRANSITIONS=250} [2022-11-16 11:33:43,248 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 101 predicate places. [2022-11-16 11:33:43,249 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 250 transitions, 2241 flow [2022-11-16 11:33:43,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 113.5) internal successors, (1589), 14 states have internal predecessors, (1589), 0 states have call successors, (0), 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-16 11:33:43,249 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:43,250 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:43,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:33:43,250 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1702711895, now seen corresponding path program 2 times [2022-11-16 11:33:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:43,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80221448] [2022-11-16 11:33:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:43,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:45,328 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-16 11:33:45,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:45,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80221448] [2022-11-16 11:33:45,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80221448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:45,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:45,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 11:33:45,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725122234] [2022-11-16 11:33:45,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:45,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:33:45,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:33:45,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:33:45,332 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 152 [2022-11-16 11:33:45,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 250 transitions, 2241 flow. Second operand has 15 states, 15 states have (on average 110.53333333333333) internal successors, (1658), 15 states have internal predecessors, (1658), 0 states have call successors, (0), 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-16 11:33:45,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:45,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 152 [2022-11-16 11:33:45,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:47,056 INFO L130 PetriNetUnfolder]: 897/3604 cut-off events. [2022-11-16 11:33:47,056 INFO L131 PetriNetUnfolder]: For 19098/19602 co-relation queries the response was YES. [2022-11-16 11:33:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12683 conditions, 3604 events. 897/3604 cut-off events. For 19098/19602 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 35364 event pairs, 140 based on Foata normal form. 193/3666 useless extension candidates. Maximal degree in co-relation 12521. Up to 575 conditions per place. [2022-11-16 11:33:47,105 INFO L137 encePairwiseOnDemand]: 139/152 looper letters, 114 selfloop transitions, 66 changer transitions 8/296 dead transitions. [2022-11-16 11:33:47,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 296 transitions, 3049 flow [2022-11-16 11:33:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:33:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:33:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1498 transitions. [2022-11-16 11:33:47,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7580971659919028 [2022-11-16 11:33:47,107 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1498 transitions. [2022-11-16 11:33:47,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1498 transitions. [2022-11-16 11:33:47,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:47,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1498 transitions. [2022-11-16 11:33:47,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.23076923076923) internal successors, (1498), 13 states have internal predecessors, (1498), 0 states have call successors, (0), 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-16 11:33:47,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 152.0) internal successors, (2128), 14 states have internal predecessors, (2128), 0 states have call successors, (0), 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-16 11:33:47,115 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 152.0) internal successors, (2128), 14 states have internal predecessors, (2128), 0 states have call successors, (0), 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-16 11:33:47,115 INFO L175 Difference]: Start difference. First operand has 260 places, 250 transitions, 2241 flow. Second operand 13 states and 1498 transitions. [2022-11-16 11:33:47,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 296 transitions, 3049 flow [2022-11-16 11:33:47,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 296 transitions, 2888 flow, removed 62 selfloop flow, removed 10 redundant places. [2022-11-16 11:33:47,216 INFO L231 Difference]: Finished difference. Result has 262 places, 252 transitions, 2334 flow [2022-11-16 11:33:47,217 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2334, PETRI_PLACES=262, PETRI_TRANSITIONS=252} [2022-11-16 11:33:47,217 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 103 predicate places. [2022-11-16 11:33:47,217 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 252 transitions, 2334 flow [2022-11-16 11:33:47,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 110.53333333333333) internal successors, (1658), 15 states have internal predecessors, (1658), 0 states have call successors, (0), 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-16 11:33:47,218 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:47,218 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:47,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:33:47,219 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -388551189, now seen corresponding path program 3 times [2022-11-16 11:33:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:47,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814377177] [2022-11-16 11:33:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:47,568 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-16 11:33:47,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:47,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814377177] [2022-11-16 11:33:47,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814377177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:47,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:47,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:33:47,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891909225] [2022-11-16 11:33:47,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:47,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:33:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:47,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:33:47,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:33:47,572 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 152 [2022-11-16 11:33:47,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 252 transitions, 2334 flow. Second operand has 9 states, 9 states have (on average 126.33333333333333) internal successors, (1137), 9 states have internal predecessors, (1137), 0 states have call successors, (0), 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-16 11:33:47,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:47,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 152 [2022-11-16 11:33:47,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:49,119 INFO L130 PetriNetUnfolder]: 2195/5382 cut-off events. [2022-11-16 11:33:49,119 INFO L131 PetriNetUnfolder]: For 49580/49817 co-relation queries the response was YES. [2022-11-16 11:33:49,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24367 conditions, 5382 events. 2195/5382 cut-off events. For 49580/49817 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 48481 event pairs, 125 based on Foata normal form. 112/5416 useless extension candidates. Maximal degree in co-relation 24299. Up to 1209 conditions per place. [2022-11-16 11:33:49,165 INFO L137 encePairwiseOnDemand]: 142/152 looper letters, 246 selfloop transitions, 19 changer transitions 93/481 dead transitions. [2022-11-16 11:33:49,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 481 transitions, 6579 flow [2022-11-16 11:33:49,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:33:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 11:33:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1573 transitions. [2022-11-16 11:33:49,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.862390350877193 [2022-11-16 11:33:49,168 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1573 transitions. [2022-11-16 11:33:49,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1573 transitions. [2022-11-16 11:33:49,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:49,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1573 transitions. [2022-11-16 11:33:49,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 131.08333333333334) internal successors, (1573), 12 states have internal predecessors, (1573), 0 states have call successors, (0), 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-16 11:33:49,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 152.0) internal successors, (1976), 13 states have internal predecessors, (1976), 0 states have call successors, (0), 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-16 11:33:49,175 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 152.0) internal successors, (1976), 13 states have internal predecessors, (1976), 0 states have call successors, (0), 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-16 11:33:49,175 INFO L175 Difference]: Start difference. First operand has 262 places, 252 transitions, 2334 flow. Second operand 12 states and 1573 transitions. [2022-11-16 11:33:49,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 481 transitions, 6579 flow [2022-11-16 11:33:49,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 481 transitions, 6050 flow, removed 99 selfloop flow, removed 19 redundant places. [2022-11-16 11:33:49,335 INFO L231 Difference]: Finished difference. Result has 257 places, 245 transitions, 2090 flow [2022-11-16 11:33:49,336 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2090, PETRI_PLACES=257, PETRI_TRANSITIONS=245} [2022-11-16 11:33:49,336 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 98 predicate places. [2022-11-16 11:33:49,337 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 245 transitions, 2090 flow [2022-11-16 11:33:49,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.33333333333333) internal successors, (1137), 9 states have internal predecessors, (1137), 0 states have call successors, (0), 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-16 11:33:49,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:49,337 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:49,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:33:49,338 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash 246897352, now seen corresponding path program 1 times [2022-11-16 11:33:49,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:49,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061521691] [2022-11-16 11:33:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:33:53,894 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-16 11:33:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:33:53,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061521691] [2022-11-16 11:33:53,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061521691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:33:53,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:33:53,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-16 11:33:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324808540] [2022-11-16 11:33:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:33:53,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 11:33:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:33:53,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 11:33:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:33:53,899 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 152 [2022-11-16 11:33:53,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 245 transitions, 2090 flow. Second operand has 21 states, 21 states have (on average 95.33333333333333) internal successors, (2002), 21 states have internal predecessors, (2002), 0 states have call successors, (0), 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-16 11:33:53,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:33:53,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 152 [2022-11-16 11:33:53,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:33:56,971 INFO L130 PetriNetUnfolder]: 1029/4136 cut-off events. [2022-11-16 11:33:56,971 INFO L131 PetriNetUnfolder]: For 14905/15385 co-relation queries the response was YES. [2022-11-16 11:33:56,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13710 conditions, 4136 events. 1029/4136 cut-off events. For 14905/15385 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 44742 event pairs, 103 based on Foata normal form. 83/4071 useless extension candidates. Maximal degree in co-relation 13551. Up to 739 conditions per place. [2022-11-16 11:33:57,002 INFO L137 encePairwiseOnDemand]: 133/152 looper letters, 127 selfloop transitions, 74 changer transitions 12/307 dead transitions. [2022-11-16 11:33:57,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 307 transitions, 2890 flow [2022-11-16 11:33:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:33:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-16 11:33:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2255 transitions. [2022-11-16 11:33:57,006 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6450228832951945 [2022-11-16 11:33:57,006 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2255 transitions. [2022-11-16 11:33:57,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2255 transitions. [2022-11-16 11:33:57,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:33:57,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2255 transitions. [2022-11-16 11:33:57,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 98.04347826086956) internal successors, (2255), 23 states have internal predecessors, (2255), 0 states have call successors, (0), 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-16 11:33:57,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 152.0) internal successors, (3648), 24 states have internal predecessors, (3648), 0 states have call successors, (0), 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-16 11:33:57,016 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 152.0) internal successors, (3648), 24 states have internal predecessors, (3648), 0 states have call successors, (0), 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-16 11:33:57,017 INFO L175 Difference]: Start difference. First operand has 257 places, 245 transitions, 2090 flow. Second operand 23 states and 2255 transitions. [2022-11-16 11:33:57,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 307 transitions, 2890 flow [2022-11-16 11:33:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 307 transitions, 2548 flow, removed 77 selfloop flow, removed 26 redundant places. [2022-11-16 11:33:57,178 INFO L231 Difference]: Finished difference. Result has 257 places, 264 transitions, 2227 flow [2022-11-16 11:33:57,178 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2227, PETRI_PLACES=257, PETRI_TRANSITIONS=264} [2022-11-16 11:33:57,179 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 98 predicate places. [2022-11-16 11:33:57,179 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 264 transitions, 2227 flow [2022-11-16 11:33:57,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 95.33333333333333) internal successors, (2002), 21 states have internal predecessors, (2002), 0 states have call successors, (0), 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-16 11:33:57,179 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:33:57,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:33:57,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:33:57,180 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:33:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:33:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1441274690, now seen corresponding path program 2 times [2022-11-16 11:33:57,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:33:57,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827784852] [2022-11-16 11:33:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:33:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:33:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:00,475 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-16 11:34:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827784852] [2022-11-16 11:34:00,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827784852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:00,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:00,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 11:34:00,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735743419] [2022-11-16 11:34:00,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:00,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:34:00,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:00,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:34:00,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:34:00,479 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 152 [2022-11-16 11:34:00,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 264 transitions, 2227 flow. Second operand has 17 states, 17 states have (on average 110.29411764705883) internal successors, (1875), 17 states have internal predecessors, (1875), 0 states have call successors, (0), 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-16 11:34:00,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:00,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 152 [2022-11-16 11:34:00,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:02,051 INFO L130 PetriNetUnfolder]: 1155/4655 cut-off events. [2022-11-16 11:34:02,051 INFO L131 PetriNetUnfolder]: For 10436/10812 co-relation queries the response was YES. [2022-11-16 11:34:02,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11138 conditions, 4655 events. 1155/4655 cut-off events. For 10436/10812 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 52354 event pairs, 83 based on Foata normal form. 115/4582 useless extension candidates. Maximal degree in co-relation 11070. Up to 740 conditions per place. [2022-11-16 11:34:02,124 INFO L137 encePairwiseOnDemand]: 137/152 looper letters, 112 selfloop transitions, 69 changer transitions 7/297 dead transitions. [2022-11-16 11:34:02,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 297 transitions, 2825 flow [2022-11-16 11:34:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:34:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 11:34:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1703 transitions. [2022-11-16 11:34:02,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7469298245614036 [2022-11-16 11:34:02,129 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1703 transitions. [2022-11-16 11:34:02,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1703 transitions. [2022-11-16 11:34:02,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:02,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1703 transitions. [2022-11-16 11:34:02,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 113.53333333333333) internal successors, (1703), 15 states have internal predecessors, (1703), 0 states have call successors, (0), 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-16 11:34:02,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 152.0) internal successors, (2432), 16 states have internal predecessors, (2432), 0 states have call successors, (0), 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-16 11:34:02,137 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 152.0) internal successors, (2432), 16 states have internal predecessors, (2432), 0 states have call successors, (0), 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-16 11:34:02,137 INFO L175 Difference]: Start difference. First operand has 257 places, 264 transitions, 2227 flow. Second operand 15 states and 1703 transitions. [2022-11-16 11:34:02,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 297 transitions, 2825 flow [2022-11-16 11:34:02,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 297 transitions, 2681 flow, removed 52 selfloop flow, removed 14 redundant places. [2022-11-16 11:34:02,195 INFO L231 Difference]: Finished difference. Result has 257 places, 269 transitions, 2334 flow [2022-11-16 11:34:02,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2334, PETRI_PLACES=257, PETRI_TRANSITIONS=269} [2022-11-16 11:34:02,197 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 98 predicate places. [2022-11-16 11:34:02,198 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 269 transitions, 2334 flow [2022-11-16 11:34:02,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 110.29411764705883) internal successors, (1875), 17 states have internal predecessors, (1875), 0 states have call successors, (0), 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-16 11:34:02,198 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:02,199 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:02,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:34:02,199 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1765335626, now seen corresponding path program 3 times [2022-11-16 11:34:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:02,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646856916] [2022-11-16 11:34:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:02,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:04,593 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-16 11:34:04,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:04,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646856916] [2022-11-16 11:34:04,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646856916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:04,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:04,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-16 11:34:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122970585] [2022-11-16 11:34:04,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:04,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:34:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:04,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:34:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:34:04,597 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 152 [2022-11-16 11:34:04,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 269 transitions, 2334 flow. Second operand has 20 states, 20 states have (on average 99.1) internal successors, (1982), 20 states have internal predecessors, (1982), 0 states have call successors, (0), 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-16 11:34:04,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:04,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 152 [2022-11-16 11:34:04,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:06,805 INFO L130 PetriNetUnfolder]: 1622/6604 cut-off events. [2022-11-16 11:34:06,805 INFO L131 PetriNetUnfolder]: For 12699/12977 co-relation queries the response was YES. [2022-11-16 11:34:06,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15300 conditions, 6604 events. 1622/6604 cut-off events. For 12699/12977 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 80094 event pairs, 87 based on Foata normal form. 110/6466 useless extension candidates. Maximal degree in co-relation 15239. Up to 1068 conditions per place. [2022-11-16 11:34:06,880 INFO L137 encePairwiseOnDemand]: 132/152 looper letters, 156 selfloop transitions, 93 changer transitions 13/363 dead transitions. [2022-11-16 11:34:06,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 363 transitions, 3816 flow [2022-11-16 11:34:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:34:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-16 11:34:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2035 transitions. [2022-11-16 11:34:06,884 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6694078947368421 [2022-11-16 11:34:06,884 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2035 transitions. [2022-11-16 11:34:06,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2035 transitions. [2022-11-16 11:34:06,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:06,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2035 transitions. [2022-11-16 11:34:06,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 101.75) internal successors, (2035), 20 states have internal predecessors, (2035), 0 states have call successors, (0), 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-16 11:34:06,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 152.0) internal successors, (3192), 21 states have internal predecessors, (3192), 0 states have call successors, (0), 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-16 11:34:06,894 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 152.0) internal successors, (3192), 21 states have internal predecessors, (3192), 0 states have call successors, (0), 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-16 11:34:06,894 INFO L175 Difference]: Start difference. First operand has 257 places, 269 transitions, 2334 flow. Second operand 20 states and 2035 transitions. [2022-11-16 11:34:06,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 363 transitions, 3816 flow [2022-11-16 11:34:06,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 363 transitions, 3659 flow, removed 26 selfloop flow, removed 10 redundant places. [2022-11-16 11:34:06,961 INFO L231 Difference]: Finished difference. Result has 272 places, 305 transitions, 3038 flow [2022-11-16 11:34:06,961 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3038, PETRI_PLACES=272, PETRI_TRANSITIONS=305} [2022-11-16 11:34:06,961 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 113 predicate places. [2022-11-16 11:34:06,962 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 305 transitions, 3038 flow [2022-11-16 11:34:06,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 99.1) internal successors, (1982), 20 states have internal predecessors, (1982), 0 states have call successors, (0), 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-16 11:34:06,962 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:06,962 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:06,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:34:06,962 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:06,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1909756198, now seen corresponding path program 4 times [2022-11-16 11:34:06,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:06,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980375073] [2022-11-16 11:34:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:09,682 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-16 11:34:09,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980375073] [2022-11-16 11:34:09,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980375073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:09,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:09,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 11:34:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600606491] [2022-11-16 11:34:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:09,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:34:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:34:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:34:09,686 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 152 [2022-11-16 11:34:09,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 305 transitions, 3038 flow. Second operand has 17 states, 17 states have (on average 109.3529411764706) internal successors, (1859), 17 states have internal predecessors, (1859), 0 states have call successors, (0), 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-16 11:34:09,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:09,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 152 [2022-11-16 11:34:09,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:12,608 INFO L130 PetriNetUnfolder]: 1714/7025 cut-off events. [2022-11-16 11:34:12,608 INFO L131 PetriNetUnfolder]: For 15325/15729 co-relation queries the response was YES. [2022-11-16 11:34:12,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16587 conditions, 7025 events. 1714/7025 cut-off events. For 15325/15729 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 86788 event pairs, 108 based on Foata normal form. 163/6895 useless extension candidates. Maximal degree in co-relation 16516. Up to 1154 conditions per place. [2022-11-16 11:34:12,669 INFO L137 encePairwiseOnDemand]: 137/152 looper letters, 117 selfloop transitions, 79 changer transitions 42/349 dead transitions. [2022-11-16 11:34:12,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 349 transitions, 3837 flow [2022-11-16 11:34:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:34:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-16 11:34:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2136 transitions. [2022-11-16 11:34:12,674 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.739612188365651 [2022-11-16 11:34:12,674 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2136 transitions. [2022-11-16 11:34:12,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2136 transitions. [2022-11-16 11:34:12,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:12,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2136 transitions. [2022-11-16 11:34:12,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 112.42105263157895) internal successors, (2136), 19 states have internal predecessors, (2136), 0 states have call successors, (0), 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-16 11:34:12,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 152.0) internal successors, (3040), 20 states have internal predecessors, (3040), 0 states have call successors, (0), 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-16 11:34:12,684 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 152.0) internal successors, (3040), 20 states have internal predecessors, (3040), 0 states have call successors, (0), 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-16 11:34:12,684 INFO L175 Difference]: Start difference. First operand has 272 places, 305 transitions, 3038 flow. Second operand 19 states and 2136 transitions. [2022-11-16 11:34:12,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 349 transitions, 3837 flow [2022-11-16 11:34:12,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 349 transitions, 3737 flow, removed 43 selfloop flow, removed 10 redundant places. [2022-11-16 11:34:12,776 INFO L231 Difference]: Finished difference. Result has 287 places, 283 transitions, 2889 flow [2022-11-16 11:34:12,777 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2966, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2889, PETRI_PLACES=287, PETRI_TRANSITIONS=283} [2022-11-16 11:34:12,777 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 128 predicate places. [2022-11-16 11:34:12,778 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 283 transitions, 2889 flow [2022-11-16 11:34:12,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 109.3529411764706) internal successors, (1859), 17 states have internal predecessors, (1859), 0 states have call successors, (0), 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-16 11:34:12,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:12,778 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:12,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:34:12,779 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:12,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2120487328, now seen corresponding path program 5 times [2022-11-16 11:34:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:12,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676028317] [2022-11-16 11:34:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:12,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:16,710 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-16 11:34:16,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:16,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676028317] [2022-11-16 11:34:16,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676028317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:16,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:16,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-16 11:34:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440458226] [2022-11-16 11:34:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:16,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 11:34:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 11:34:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2022-11-16 11:34:16,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 152 [2022-11-16 11:34:16,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 283 transitions, 2889 flow. Second operand has 24 states, 24 states have (on average 92.08333333333333) internal successors, (2210), 24 states have internal predecessors, (2210), 0 states have call successors, (0), 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-16 11:34:16,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:16,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 152 [2022-11-16 11:34:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:19,110 INFO L130 PetriNetUnfolder]: 1369/5801 cut-off events. [2022-11-16 11:34:19,110 INFO L131 PetriNetUnfolder]: For 17742/18035 co-relation queries the response was YES. [2022-11-16 11:34:19,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14604 conditions, 5801 events. 1369/5801 cut-off events. For 17742/18035 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 69196 event pairs, 110 based on Foata normal form. 125/5713 useless extension candidates. Maximal degree in co-relation 14520. Up to 942 conditions per place. [2022-11-16 11:34:19,175 INFO L137 encePairwiseOnDemand]: 132/152 looper letters, 134 selfloop transitions, 89 changer transitions 9/325 dead transitions. [2022-11-16 11:34:19,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 325 transitions, 3710 flow [2022-11-16 11:34:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:34:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-16 11:34:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1902 transitions. [2022-11-16 11:34:19,178 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6256578947368421 [2022-11-16 11:34:19,179 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1902 transitions. [2022-11-16 11:34:19,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1902 transitions. [2022-11-16 11:34:19,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:19,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1902 transitions. [2022-11-16 11:34:19,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 95.1) internal successors, (1902), 20 states have internal predecessors, (1902), 0 states have call successors, (0), 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-16 11:34:19,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 152.0) internal successors, (3192), 21 states have internal predecessors, (3192), 0 states have call successors, (0), 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-16 11:34:19,185 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 152.0) internal successors, (3192), 21 states have internal predecessors, (3192), 0 states have call successors, (0), 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-16 11:34:19,185 INFO L175 Difference]: Start difference. First operand has 287 places, 283 transitions, 2889 flow. Second operand 20 states and 1902 transitions. [2022-11-16 11:34:19,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 325 transitions, 3710 flow [2022-11-16 11:34:19,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 325 transitions, 3442 flow, removed 34 selfloop flow, removed 21 redundant places. [2022-11-16 11:34:19,264 INFO L231 Difference]: Finished difference. Result has 281 places, 293 transitions, 3003 flow [2022-11-16 11:34:19,264 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2669, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3003, PETRI_PLACES=281, PETRI_TRANSITIONS=293} [2022-11-16 11:34:19,264 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 122 predicate places. [2022-11-16 11:34:19,265 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 293 transitions, 3003 flow [2022-11-16 11:34:19,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 92.08333333333333) internal successors, (2210), 24 states have internal predecessors, (2210), 0 states have call successors, (0), 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-16 11:34:19,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:19,266 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:19,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:34:19,266 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1360115842, now seen corresponding path program 6 times [2022-11-16 11:34:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:19,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543389447] [2022-11-16 11:34:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:19,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,167 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-16 11:34:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:23,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543389447] [2022-11-16 11:34:23,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543389447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:23,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:23,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-16 11:34:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643066805] [2022-11-16 11:34:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:23,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:34:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:34:23,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:34:23,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 152 [2022-11-16 11:34:23,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 293 transitions, 3003 flow. Second operand has 23 states, 23 states have (on average 92.17391304347827) internal successors, (2120), 23 states have internal predecessors, (2120), 0 states have call successors, (0), 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-16 11:34:23,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:23,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 152 [2022-11-16 11:34:23,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:25,605 INFO L130 PetriNetUnfolder]: 1418/6000 cut-off events. [2022-11-16 11:34:25,606 INFO L131 PetriNetUnfolder]: For 18167/18565 co-relation queries the response was YES. [2022-11-16 11:34:25,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14902 conditions, 6000 events. 1418/6000 cut-off events. For 18167/18565 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 72201 event pairs, 104 based on Foata normal form. 153/5920 useless extension candidates. Maximal degree in co-relation 14829. Up to 984 conditions per place. [2022-11-16 11:34:25,666 INFO L137 encePairwiseOnDemand]: 133/152 looper letters, 127 selfloop transitions, 77 changer transitions 28/325 dead transitions. [2022-11-16 11:34:25,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 325 transitions, 3717 flow [2022-11-16 11:34:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:34:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-16 11:34:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1811 transitions. [2022-11-16 11:34:25,669 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6270775623268698 [2022-11-16 11:34:25,669 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1811 transitions. [2022-11-16 11:34:25,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1811 transitions. [2022-11-16 11:34:25,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:25,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1811 transitions. [2022-11-16 11:34:25,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 95.3157894736842) internal successors, (1811), 19 states have internal predecessors, (1811), 0 states have call successors, (0), 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-16 11:34:25,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 152.0) internal successors, (3040), 20 states have internal predecessors, (3040), 0 states have call successors, (0), 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-16 11:34:25,678 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 152.0) internal successors, (3040), 20 states have internal predecessors, (3040), 0 states have call successors, (0), 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-16 11:34:25,678 INFO L175 Difference]: Start difference. First operand has 281 places, 293 transitions, 3003 flow. Second operand 19 states and 1811 transitions. [2022-11-16 11:34:25,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 325 transitions, 3717 flow [2022-11-16 11:34:25,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 325 transitions, 3578 flow, removed 16 selfloop flow, removed 14 redundant places. [2022-11-16 11:34:25,769 INFO L231 Difference]: Finished difference. Result has 287 places, 279 transitions, 2870 flow [2022-11-16 11:34:25,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2874, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2870, PETRI_PLACES=287, PETRI_TRANSITIONS=279} [2022-11-16 11:34:25,770 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 128 predicate places. [2022-11-16 11:34:25,770 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 279 transitions, 2870 flow [2022-11-16 11:34:25,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 92.17391304347827) internal successors, (2120), 23 states have internal predecessors, (2120), 0 states have call successors, (0), 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-16 11:34:25,771 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:25,771 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:25,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:34:25,772 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1853003342, now seen corresponding path program 7 times [2022-11-16 11:34:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:25,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229458160] [2022-11-16 11:34:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:25,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,282 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-16 11:34:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:28,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229458160] [2022-11-16 11:34:28,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229458160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:28,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:28,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-16 11:34:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925742132] [2022-11-16 11:34:28,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:28,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 11:34:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:28,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 11:34:28,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:34:28,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 152 [2022-11-16 11:34:28,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 279 transitions, 2870 flow. Second operand has 21 states, 21 states have (on average 99.0) internal successors, (2079), 21 states have internal predecessors, (2079), 0 states have call successors, (0), 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-16 11:34:28,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:28,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 152 [2022-11-16 11:34:28,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:30,577 INFO L130 PetriNetUnfolder]: 1329/5775 cut-off events. [2022-11-16 11:34:30,577 INFO L131 PetriNetUnfolder]: For 18904/19228 co-relation queries the response was YES. [2022-11-16 11:34:30,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14969 conditions, 5775 events. 1329/5775 cut-off events. For 18904/19228 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 68786 event pairs, 85 based on Foata normal form. 137/5723 useless extension candidates. Maximal degree in co-relation 14894. Up to 930 conditions per place. [2022-11-16 11:34:30,633 INFO L137 encePairwiseOnDemand]: 132/152 looper letters, 148 selfloop transitions, 86 changer transitions 16/351 dead transitions. [2022-11-16 11:34:30,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 351 transitions, 4115 flow [2022-11-16 11:34:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:34:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 11:34:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2141 transitions. [2022-11-16 11:34:30,637 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6707393483709273 [2022-11-16 11:34:30,637 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2141 transitions. [2022-11-16 11:34:30,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2141 transitions. [2022-11-16 11:34:30,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:30,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2141 transitions. [2022-11-16 11:34:30,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 101.95238095238095) internal successors, (2141), 21 states have internal predecessors, (2141), 0 states have call successors, (0), 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-16 11:34:30,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 0 states have call successors, (0), 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-16 11:34:30,646 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 0 states have call successors, (0), 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-16 11:34:30,646 INFO L175 Difference]: Start difference. First operand has 287 places, 279 transitions, 2870 flow. Second operand 21 states and 2141 transitions. [2022-11-16 11:34:30,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 351 transitions, 4115 flow [2022-11-16 11:34:30,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 351 transitions, 3809 flow, removed 24 selfloop flow, removed 23 redundant places. [2022-11-16 11:34:30,741 INFO L231 Difference]: Finished difference. Result has 280 places, 292 transitions, 3040 flow [2022-11-16 11:34:30,742 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2643, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3040, PETRI_PLACES=280, PETRI_TRANSITIONS=292} [2022-11-16 11:34:30,742 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 121 predicate places. [2022-11-16 11:34:30,742 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 292 transitions, 3040 flow [2022-11-16 11:34:30,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 99.0) internal successors, (2079), 21 states have internal predecessors, (2079), 0 states have call successors, (0), 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-16 11:34:30,743 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:30,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:30,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:34:30,744 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1382883944, now seen corresponding path program 8 times [2022-11-16 11:34:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:30,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564469547] [2022-11-16 11:34:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:34,672 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-16 11:34:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564469547] [2022-11-16 11:34:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564469547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:34,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:34,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-11-16 11:34:34,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993587743] [2022-11-16 11:34:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:34,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 11:34:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 11:34:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:34:34,677 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 152 [2022-11-16 11:34:34,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 292 transitions, 3040 flow. Second operand has 25 states, 25 states have (on average 91.04) internal successors, (2276), 25 states have internal predecessors, (2276), 0 states have call successors, (0), 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-16 11:34:34,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:34,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 152 [2022-11-16 11:34:34,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:37,823 INFO L130 PetriNetUnfolder]: 1536/6669 cut-off events. [2022-11-16 11:34:37,823 INFO L131 PetriNetUnfolder]: For 20531/20919 co-relation queries the response was YES. [2022-11-16 11:34:37,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16560 conditions, 6669 events. 1536/6669 cut-off events. For 20531/20919 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 82050 event pairs, 122 based on Foata normal form. 168/6586 useless extension candidates. Maximal degree in co-relation 16478. Up to 1106 conditions per place. [2022-11-16 11:34:37,880 INFO L137 encePairwiseOnDemand]: 132/152 looper letters, 127 selfloop transitions, 78 changer transitions 54/351 dead transitions. [2022-11-16 11:34:37,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 351 transitions, 4104 flow [2022-11-16 11:34:37,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 11:34:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 11:34:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1982 transitions. [2022-11-16 11:34:37,885 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6209273182957393 [2022-11-16 11:34:37,885 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1982 transitions. [2022-11-16 11:34:37,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1982 transitions. [2022-11-16 11:34:37,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:37,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1982 transitions. [2022-11-16 11:34:37,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 94.38095238095238) internal successors, (1982), 21 states have internal predecessors, (1982), 0 states have call successors, (0), 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-16 11:34:37,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 0 states have call successors, (0), 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-16 11:34:37,893 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 0 states have call successors, (0), 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-16 11:34:37,894 INFO L175 Difference]: Start difference. First operand has 280 places, 292 transitions, 3040 flow. Second operand 21 states and 1982 transitions. [2022-11-16 11:34:37,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 351 transitions, 4104 flow [2022-11-16 11:34:37,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 351 transitions, 3974 flow, removed 29 selfloop flow, removed 12 redundant places. [2022-11-16 11:34:37,980 INFO L231 Difference]: Finished difference. Result has 291 places, 271 transitions, 2896 flow [2022-11-16 11:34:37,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2943, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2896, PETRI_PLACES=291, PETRI_TRANSITIONS=271} [2022-11-16 11:34:37,981 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 132 predicate places. [2022-11-16 11:34:37,981 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 271 transitions, 2896 flow [2022-11-16 11:34:37,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 91.04) internal successors, (2276), 25 states have internal predecessors, (2276), 0 states have call successors, (0), 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-16 11:34:37,982 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:37,982 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:37,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 11:34:37,982 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:37,983 INFO L85 PathProgramCache]: Analyzing trace with hash -101425784, now seen corresponding path program 9 times [2022-11-16 11:34:37,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:37,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888152313] [2022-11-16 11:34:37,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:40,802 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-16 11:34:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888152313] [2022-11-16 11:34:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888152313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:40,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:40,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 11:34:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832415487] [2022-11-16 11:34:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:40,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:34:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:40,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:34:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:34:40,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 152 [2022-11-16 11:34:40,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 271 transitions, 2896 flow. Second operand has 17 states, 17 states have (on average 103.41176470588235) internal successors, (1758), 17 states have internal predecessors, (1758), 0 states have call successors, (0), 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-16 11:34:40,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:40,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 152 [2022-11-16 11:34:40,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:42,970 INFO L130 PetriNetUnfolder]: 1455/6312 cut-off events. [2022-11-16 11:34:42,970 INFO L131 PetriNetUnfolder]: For 22334/22723 co-relation queries the response was YES. [2022-11-16 11:34:43,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15870 conditions, 6312 events. 1455/6312 cut-off events. For 22334/22723 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 77001 event pairs, 91 based on Foata normal form. 152/6232 useless extension candidates. Maximal degree in co-relation 15823. Up to 1042 conditions per place. [2022-11-16 11:34:43,023 INFO L137 encePairwiseOnDemand]: 136/152 looper letters, 144 selfloop transitions, 63 changer transitions 37/346 dead transitions. [2022-11-16 11:34:43,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 346 transitions, 4171 flow [2022-11-16 11:34:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:34:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:34:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1722 transitions. [2022-11-16 11:34:43,026 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7080592105263158 [2022-11-16 11:34:43,027 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1722 transitions. [2022-11-16 11:34:43,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1722 transitions. [2022-11-16 11:34:43,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:43,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1722 transitions. [2022-11-16 11:34:43,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 107.625) internal successors, (1722), 16 states have internal predecessors, (1722), 0 states have call successors, (0), 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-16 11:34:43,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 152.0) internal successors, (2584), 17 states have internal predecessors, (2584), 0 states have call successors, (0), 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-16 11:34:43,031 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 152.0) internal successors, (2584), 17 states have internal predecessors, (2584), 0 states have call successors, (0), 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-16 11:34:43,032 INFO L175 Difference]: Start difference. First operand has 291 places, 271 transitions, 2896 flow. Second operand 16 states and 1722 transitions. [2022-11-16 11:34:43,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 346 transitions, 4171 flow [2022-11-16 11:34:43,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 346 transitions, 3802 flow, removed 41 selfloop flow, removed 28 redundant places. [2022-11-16 11:34:43,108 INFO L231 Difference]: Finished difference. Result has 274 places, 265 transitions, 2731 flow [2022-11-16 11:34:43,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2731, PETRI_PLACES=274, PETRI_TRANSITIONS=265} [2022-11-16 11:34:43,109 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 115 predicate places. [2022-11-16 11:34:43,109 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 265 transitions, 2731 flow [2022-11-16 11:34:43,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 103.41176470588235) internal successors, (1758), 17 states have internal predecessors, (1758), 0 states have call successors, (0), 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-16 11:34:43,109 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:43,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:43,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 11:34:43,110 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:43,110 INFO L85 PathProgramCache]: Analyzing trace with hash -668703318, now seen corresponding path program 10 times [2022-11-16 11:34:43,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:43,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789812560] [2022-11-16 11:34:43,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:43,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:47,690 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-16 11:34:47,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:47,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789812560] [2022-11-16 11:34:47,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789812560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:47,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:47,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-16 11:34:47,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591704303] [2022-11-16 11:34:47,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:47,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:34:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:47,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:34:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:34:47,694 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 152 [2022-11-16 11:34:47,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 265 transitions, 2731 flow. Second operand has 23 states, 23 states have (on average 95.1304347826087) internal successors, (2188), 23 states have internal predecessors, (2188), 0 states have call successors, (0), 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-16 11:34:47,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:34:47,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 152 [2022-11-16 11:34:47,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:34:50,185 INFO L130 PetriNetUnfolder]: 1528/6468 cut-off events. [2022-11-16 11:34:50,185 INFO L131 PetriNetUnfolder]: For 20468/20797 co-relation queries the response was YES. [2022-11-16 11:34:50,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15919 conditions, 6468 events. 1528/6468 cut-off events. For 20468/20797 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 79463 event pairs, 69 based on Foata normal form. 118/6332 useless extension candidates. Maximal degree in co-relation 15876. Up to 1070 conditions per place. [2022-11-16 11:34:50,252 INFO L137 encePairwiseOnDemand]: 131/152 looper letters, 117 selfloop transitions, 88 changer transitions 12/311 dead transitions. [2022-11-16 11:34:50,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 311 transitions, 3578 flow [2022-11-16 11:34:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:34:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-16 11:34:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2430 transitions. [2022-11-16 11:34:50,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6394736842105263 [2022-11-16 11:34:50,256 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2430 transitions. [2022-11-16 11:34:50,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2430 transitions. [2022-11-16 11:34:50,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:34:50,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2430 transitions. [2022-11-16 11:34:50,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 97.2) internal successors, (2430), 25 states have internal predecessors, (2430), 0 states have call successors, (0), 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-16 11:34:50,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 152.0) internal successors, (3952), 26 states have internal predecessors, (3952), 0 states have call successors, (0), 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-16 11:34:50,265 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 152.0) internal successors, (3952), 26 states have internal predecessors, (3952), 0 states have call successors, (0), 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-16 11:34:50,265 INFO L175 Difference]: Start difference. First operand has 274 places, 265 transitions, 2731 flow. Second operand 25 states and 2430 transitions. [2022-11-16 11:34:50,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 311 transitions, 3578 flow [2022-11-16 11:34:50,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 311 transitions, 3452 flow, removed 22 selfloop flow, removed 13 redundant places. [2022-11-16 11:34:50,379 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 3079 flow [2022-11-16 11:34:50,379 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3079, PETRI_PLACES=288, PETRI_TRANSITIONS=280} [2022-11-16 11:34:50,380 INFO L288 CegarLoopForPetriNet]: 159 programPoint places, 129 predicate places. [2022-11-16 11:34:50,380 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 3079 flow [2022-11-16 11:34:50,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 95.1304347826087) internal successors, (2188), 23 states have internal predecessors, (2188), 0 states have call successors, (0), 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-16 11:34:50,381 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:34:50,381 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:34:50,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 11:34:50,382 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:34:50,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:50,382 INFO L85 PathProgramCache]: Analyzing trace with hash 624235336, now seen corresponding path program 11 times [2022-11-16 11:34:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:50,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209632122] [2022-11-16 11:34:50,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:50,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:34:50,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:34:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:34:50,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:34:50,730 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:34:50,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-16 11:34:50,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-16 11:34:50,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-16 11:34:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-16 11:34:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-16 11:34:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-16 11:34:50,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-16 11:34:50,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 11:34:50,735 INFO L444 BasicCegarLoop]: Path program histogram: [11, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:50,742 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:34:50,742 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:34:51,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:34:51 BasicIcfg [2022-11-16 11:34:51,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:34:51,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:34:51,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:34:51,012 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:34:51,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:32:38" (3/4) ... [2022-11-16 11:34:51,014 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:34:51,289 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:34:51,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:34:51,290 INFO L158 Benchmark]: Toolchain (without parser) took 134608.01ms. Allocated memory was 140.5MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 94.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-16 11:34:51,291 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 140.5MB. Free memory was 112.2MB in the beginning and 112.2MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:34:51,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.02ms. Allocated memory is still 140.5MB. Free memory was 94.0MB in the beginning and 97.1MB in the end (delta: -3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:34:51,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.87ms. Allocated memory is still 140.5MB. Free memory was 97.1MB in the beginning and 94.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:34:51,292 INFO L158 Benchmark]: Boogie Preprocessor took 46.13ms. Allocated memory is still 140.5MB. Free memory was 94.3MB in the beginning and 91.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:34:51,293 INFO L158 Benchmark]: RCFGBuilder took 1473.89ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 91.9MB in the beginning and 94.7MB in the end (delta: -2.9MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2022-11-16 11:34:51,293 INFO L158 Benchmark]: TraceAbstraction took 132035.87ms. Allocated memory was 169.9MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 94.7MB in the beginning and 638.9MB in the end (delta: -544.2MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-11-16 11:34:51,294 INFO L158 Benchmark]: Witness Printer took 278.36ms. Allocated memory is still 2.0GB. Free memory was 638.9MB in the beginning and 1.8GB in the end (delta: -1.1GB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-16 11:34:51,301 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.22ms. Allocated memory is still 140.5MB. Free memory was 112.2MB in the beginning and 112.2MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.02ms. Allocated memory is still 140.5MB. Free memory was 94.0MB in the beginning and 97.1MB in the end (delta: -3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.87ms. Allocated memory is still 140.5MB. Free memory was 97.1MB in the beginning and 94.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.13ms. Allocated memory is still 140.5MB. Free memory was 94.3MB in the beginning and 91.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1473.89ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 91.9MB in the beginning and 94.7MB in the end (delta: -2.9MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * TraceAbstraction took 132035.87ms. Allocated memory was 169.9MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 94.7MB in the beginning and 638.9MB in the end (delta: -544.2MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 278.36ms. Allocated memory is still 2.0GB. Free memory was 638.9MB in the beginning and 1.8GB in the end (delta: -1.1GB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L740] 0 _Bool x$flush_delayed; VAL [x$flush_delayed=0] [L753] 0 int *x$read_delayed_var; VAL [x$flush_delayed=0, x$read_delayed_var={0:0}] [L745] 0 _Bool x$r_buff0_thd3; VAL [x$flush_delayed=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L746] 0 _Bool x$r_buff0_thd4; VAL [x$flush_delayed=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L743] 0 _Bool x$r_buff0_thd1; VAL [x$flush_delayed=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L744] 0 _Bool x$r_buff0_thd2; VAL [x$flush_delayed=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; VAL [__unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L742] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; VAL [__unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L752] 0 _Bool x$read_delayed; VAL [__unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; VAL [__unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L711] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L757] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L754] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1_used=0] [L756] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int __unbuffered_p2_EAX$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L734] 0 int __unbuffered_p2_EAX$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L719] 0 int __unbuffered_p2_EAX$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L760] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L761] 0 _Bool weak$$choice1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L762] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L741] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L713] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L715] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L737] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff1=0, x$w_buff1_used=0] [L755] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L739] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L748] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L747] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L759] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L751] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L882] 0 pthread_t t2229; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t2229={12:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L883] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2229, ((void *)0), P0, ((void *)0))=-1, t2229={12:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L884] 0 pthread_t t2230; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={12:0}, t2230={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L885] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2230, ((void *)0), P1, ((void *)0))=0, t2229={12:0}, t2230={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 2 x$w_buff1 = x$w_buff0 [L795] 2 x$w_buff0 = 1 [L796] 2 x$w_buff1_used = x$w_buff0_used [L797] 2 x$w_buff0_used = (_Bool)1 [L798] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L798] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L799] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L800] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L801] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L802] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L803] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L804] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2231; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={12:0}, t2230={9:0}, t2231={10:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L887] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2231, ((void *)0), P2, ((void *)0))=1, t2229={12:0}, t2230={9:0}, t2231={10:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2232; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={12:0}, t2230={9:0}, t2231={10:0}, t2232={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L889] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2232, ((void *)0), P3, ((void *)0))=2, t2229={12:0}, t2230={9:0}, t2231={10:0}, t2232={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 3 x$flush_delayed = weak$$choice2 [L824] EXPR 3 \read(x) [L824] 3 x$mem_tmp = x [L825] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L827] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L828] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L829] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L830] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L831] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L834] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L835] EXPR 3 \read(x) [L835] 3 __unbuffered_p2_EAX = x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] 3 x = x$flush_delayed ? x$mem_tmp : x [L837] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L857] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 \read(x) [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 \read(x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L844] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L845] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L846] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L847] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 \read(x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L861] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L862] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L863] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L864] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L807] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L808] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L809] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L810] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L811] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L850] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L891] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={12:0}, t2230={9:0}, t2231={10:0}, t2232={8:0}, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L893] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L893] RET 0 assume_abort_if_not(main$tmp_guard0) [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L896] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L897] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L898] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L899] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={12:0}, t2230={9:0}, t2231={10:0}, t2232={8:0}, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L902] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L904] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={12:0}, t2230={9:0}, t2231={10:0}, t2232={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L906] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 889]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 883]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 131.6s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 60.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3379 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3379 mSDsluCounter, 4667 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4050 mSDsCounter, 1146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11222 IncrementalHoareTripleChecker+Invalid, 12368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1146 mSolverCounterUnsat, 617 mSDtfsCounter, 11222 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3761 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3079occurred in iteration=28, InterpolantAutomatonStates: 506, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 67.1s InterpolantComputationTime, 3334 NumberOfCodeBlocks, 3334 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3185 ConstructedInterpolants, 0 QuantifiedInterpolants, 48776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:34:51,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b48ea4a3-b49d-4a84-a166-ad6664a0ad8c/bin/uautomizer-tPACEb0tL8/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE