./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 0e0057cc 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_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:55:39,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:55:39,206 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:55:39,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:55:39,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:55:39,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:55:39,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:55:39,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:55:39,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:55:39,236 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:55:39,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:55:39,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:55:39,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:55:39,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:55:39,239 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:55:39,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:55:39,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:55:39,241 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:55:39,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:55:39,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:55:39,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:55:39,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:55:39,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:55:39,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:55:39,245 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:55:39,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:55:39,246 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:55:39,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:55:39,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:55:39,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:55:39,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:55:39,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:55:39,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:55:39,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:55:39,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:55:39,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:55:39,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:55:39,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:55:39,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:55:39,250 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:55:39,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:55:39,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:55:39,250 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/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_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-11-29 04:55:39,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:55:39,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:55:39,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:55:39,496 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:55:39,497 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:55:39,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2023-11-29 04:55:42,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:55:42,677 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:55:42,677 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i [2023-11-29 04:55:42,697 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/data/2093ecbf3/5b744942e1c34343bf3a06eda1394451/FLAG1aadfe64f [2023-11-29 04:55:42,712 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/data/2093ecbf3/5b744942e1c34343bf3a06eda1394451 [2023-11-29 04:55:42,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:55:42,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:55:42,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:55:42,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:55:42,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:55:42,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:55:42" (1/1) ... [2023-11-29 04:55:42,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154ceda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:42, skipping insertion in model container [2023-11-29 04:55:42,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:55:42" (1/1) ... [2023-11-29 04:55:42,780 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:55:42,941 WARN L240 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_34bfbe54-aeac-4432-94d6-eee26506c7eb/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i[994,1007] [2023-11-29 04:55:43,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:55:43,205 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:55:43,216 WARN L240 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_34bfbe54-aeac-4432-94d6-eee26506c7eb/sv-benchmarks/c/pthread-wmm/safe019_power.opt.i[994,1007] [2023-11-29 04:55:43,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:55:43,318 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:55:43,319 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:55:43,325 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:55:43,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43 WrapperNode [2023-11-29 04:55:43,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:55:43,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:55:43,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:55:43,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:55:43,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,390 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2023-11-29 04:55:43,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:55:43,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:55:43,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:55:43,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:55:43,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,436 INFO L175 MemorySlicer]: Split 30 memory accesses to 6 slices as follows [2, 1, 1, 1, 1, 24]. 80 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 0, 0, 1]. The 12 writes are split as follows [0, 1, 1, 1, 1, 8]. [2023-11-29 04:55:43,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:55:43,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:55:43,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:55:43,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:55:43,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (1/1) ... [2023-11-29 04:55:43,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:55:43,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:43,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:55:43,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:55:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:55:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:55:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:55:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:55:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 04:55:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 04:55:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:55:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:55:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:55:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:55:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:55:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 04:55:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:55:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:55:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:55:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:55:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:55:43,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:55:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:55:43,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:55:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:55:43,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:55:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 04:55:43,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 04:55:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:55:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:55:43,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:55:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:55:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:55:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 04:55:43,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:55:43,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:55:43,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:55:43,571 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:55:43,759 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:55:43,761 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:55:44,267 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:55:44,690 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:55:44,690 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:55:44,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:55:44 BoogieIcfgContainer [2023-11-29 04:55:44,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:55:44,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:55:44,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:55:44,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:55:44,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:55:42" (1/3) ... [2023-11-29 04:55:44,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fa8c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:55:44, skipping insertion in model container [2023-11-29 04:55:44,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:55:43" (2/3) ... [2023-11-29 04:55:44,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fa8c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:55:44, skipping insertion in model container [2023-11-29 04:55:44,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:55:44" (3/3) ... [2023-11-29 04:55:44,700 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2023-11-29 04:55:44,711 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 04:55:44,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:55:44,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 04:55:44,724 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:55:44,818 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:55:44,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 108 flow [2023-11-29 04:55:44,897 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2023-11-29 04:55:44,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:55:44,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 1/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-11-29 04:55:44,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 46 transitions, 108 flow [2023-11-29 04:55:44,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 42 transitions, 96 flow [2023-11-29 04:55:44,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:55:44,926 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=LoopHeads, 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;@7ba6390, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:55:44,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 04:55:44,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:55:44,961 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-11-29 04:55:44,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:55:44,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:44,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 04:55:44,963 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 04:55:44,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1394224467, now seen corresponding path program 1 times [2023-11-29 04:55:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337461264] [2023-11-29 04:55:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:45,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:45,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337461264] [2023-11-29 04:55:45,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337461264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:45,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:45,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:55:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492602661] [2023-11-29 04:55:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:45,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:55:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:45,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:55:45,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:55:45,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2023-11-29 04:55:45,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:45,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:45,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2023-11-29 04:55:45,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:46,788 INFO L124 PetriNetUnfolderBase]: 2959/4656 cut-off events. [2023-11-29 04:55:46,788 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 04:55:46,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8884 conditions, 4656 events. 2959/4656 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 29719 event pairs, 868 based on Foata normal form. 144/4716 useless extension candidates. Maximal degree in co-relation 8872. Up to 3274 conditions per place. [2023-11-29 04:55:46,830 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 37 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2023-11-29 04:55:46,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 214 flow [2023-11-29 04:55:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:55:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:55:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2023-11-29 04:55:46,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2023-11-29 04:55:46,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 104 transitions. [2023-11-29 04:55:46,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 104 transitions. [2023-11-29 04:55:46,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:46,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 104 transitions. [2023-11-29 04:55:46,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:46,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:46,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:46,854 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 3 states and 104 transitions. [2023-11-29 04:55:46,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 214 flow [2023-11-29 04:55:46,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:55:46,863 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 90 flow [2023-11-29 04:55:46,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-11-29 04:55:46,869 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-11-29 04:55:46,870 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 90 flow [2023-11-29 04:55:46,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:46,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:46,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:46,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:55:46,871 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)] === [2023-11-29 04:55:46,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1218788694, now seen corresponding path program 1 times [2023-11-29 04:55:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:46,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617112606] [2023-11-29 04:55:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617112606] [2023-11-29 04:55:47,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617112606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:47,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:47,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:55:47,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847770368] [2023-11-29 04:55:47,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:47,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:55:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:47,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:55:47,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:55:47,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2023-11-29 04:55:47,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:47,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:47,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2023-11-29 04:55:47,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:50,072 INFO L124 PetriNetUnfolderBase]: 7353/10871 cut-off events. [2023-11-29 04:55:50,072 INFO L125 PetriNetUnfolderBase]: For 672/672 co-relation queries the response was YES. [2023-11-29 04:55:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21747 conditions, 10871 events. 7353/10871 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 73499 event pairs, 1551 based on Foata normal form. 0/10643 useless extension candidates. Maximal degree in co-relation 21737. Up to 6097 conditions per place. [2023-11-29 04:55:50,170 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 36 selfloop transitions, 3 changer transitions 58/109 dead transitions. [2023-11-29 04:55:50,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 109 transitions, 438 flow [2023-11-29 04:55:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:55:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:55:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 227 transitions. [2023-11-29 04:55:50,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6168478260869565 [2023-11-29 04:55:50,174 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 227 transitions. [2023-11-29 04:55:50,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 227 transitions. [2023-11-29 04:55:50,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:50,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 227 transitions. [2023-11-29 04:55:50,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:50,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 46.0) internal successors, (414), 9 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:50,181 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 46.0) internal successors, (414), 9 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:50,181 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 8 states and 227 transitions. [2023-11-29 04:55:50,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 109 transitions, 438 flow [2023-11-29 04:55:50,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 109 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:55:50,187 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 119 flow [2023-11-29 04:55:50,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=119, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2023-11-29 04:55:50,188 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2023-11-29 04:55:50,188 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 119 flow [2023-11-29 04:55:50,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:50,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:50,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:50,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:55:50,190 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)] === [2023-11-29 04:55:50,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1929577749, now seen corresponding path program 1 times [2023-11-29 04:55:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:50,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707444255] [2023-11-29 04:55:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707444255] [2023-11-29 04:55:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707444255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:50,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:50,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:55:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171202970] [2023-11-29 04:55:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:55:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:55:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:55:50,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2023-11-29 04:55:50,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:50,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:50,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2023-11-29 04:55:50,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:52,482 INFO L124 PetriNetUnfolderBase]: 5798/9193 cut-off events. [2023-11-29 04:55:52,483 INFO L125 PetriNetUnfolderBase]: For 3000/3000 co-relation queries the response was YES. [2023-11-29 04:55:52,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19743 conditions, 9193 events. 5798/9193 cut-off events. For 3000/3000 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 64040 event pairs, 1011 based on Foata normal form. 288/9242 useless extension candidates. Maximal degree in co-relation 19728. Up to 5254 conditions per place. [2023-11-29 04:55:52,574 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 40 selfloop transitions, 2 changer transitions 41/98 dead transitions. [2023-11-29 04:55:52,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 417 flow [2023-11-29 04:55:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:55:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:55:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 204 transitions. [2023-11-29 04:55:52,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6335403726708074 [2023-11-29 04:55:52,578 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 204 transitions. [2023-11-29 04:55:52,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 204 transitions. [2023-11-29 04:55:52,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:52,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 204 transitions. [2023-11-29 04:55:52,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:52,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:52,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:52,583 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 119 flow. Second operand 7 states and 204 transitions. [2023-11-29 04:55:52,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 98 transitions, 417 flow [2023-11-29 04:55:52,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 406 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-29 04:55:52,649 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 128 flow [2023-11-29 04:55:52,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-11-29 04:55:52,650 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2023-11-29 04:55:52,651 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 128 flow [2023-11-29 04:55:52,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:52,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:52,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:52,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:55:52,652 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)] === [2023-11-29 04:55:52,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash -741596756, now seen corresponding path program 1 times [2023-11-29 04:55:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938627365] [2023-11-29 04:55:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:52,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:52,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938627365] [2023-11-29 04:55:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938627365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:52,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:52,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:55:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154179574] [2023-11-29 04:55:52,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:52,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:55:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:55:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:55:52,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:55:52,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:52,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:52,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:55:52,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:54,678 INFO L124 PetriNetUnfolderBase]: 4417/6789 cut-off events. [2023-11-29 04:55:54,679 INFO L125 PetriNetUnfolderBase]: For 4824/4824 co-relation queries the response was YES. [2023-11-29 04:55:54,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16192 conditions, 6789 events. 4417/6789 cut-off events. For 4824/4824 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 44448 event pairs, 1165 based on Foata normal form. 180/6816 useless extension candidates. Maximal degree in co-relation 16173. Up to 4042 conditions per place. [2023-11-29 04:55:54,730 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 34 selfloop transitions, 2 changer transitions 37/89 dead transitions. [2023-11-29 04:55:54,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 390 flow [2023-11-29 04:55:54,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:55:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:55:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2023-11-29 04:55:54,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6242236024844721 [2023-11-29 04:55:54,734 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 201 transitions. [2023-11-29 04:55:54,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 201 transitions. [2023-11-29 04:55:54,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:54,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 201 transitions. [2023-11-29 04:55:54,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 28.714285714285715) internal successors, (201), 7 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:54,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:54,738 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:54,739 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 128 flow. Second operand 7 states and 201 transitions. [2023-11-29 04:55:54,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 390 flow [2023-11-29 04:55:54,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 370 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 04:55:54,807 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 132 flow [2023-11-29 04:55:54,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2023-11-29 04:55:54,808 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2023-11-29 04:55:54,809 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 132 flow [2023-11-29 04:55:54,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:54,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:54,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:55:54,810 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)] === [2023-11-29 04:55:54,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash -623067990, now seen corresponding path program 1 times [2023-11-29 04:55:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:54,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550680448] [2023-11-29 04:55:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:55,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:55,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550680448] [2023-11-29 04:55:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550680448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:55,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:55,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:55:55,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229284224] [2023-11-29 04:55:55,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:55,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:55:55,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:55,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:55:55,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:55:55,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2023-11-29 04:55:55,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:55,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:55,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2023-11-29 04:55:55,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:56,995 INFO L124 PetriNetUnfolderBase]: 7302/10928 cut-off events. [2023-11-29 04:55:56,995 INFO L125 PetriNetUnfolderBase]: For 7326/7350 co-relation queries the response was YES. [2023-11-29 04:55:57,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26336 conditions, 10928 events. 7302/10928 cut-off events. For 7326/7350 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 74734 event pairs, 2895 based on Foata normal form. 276/11192 useless extension candidates. Maximal degree in co-relation 26316. Up to 4727 conditions per place. [2023-11-29 04:55:57,047 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 41 selfloop transitions, 3 changer transitions 41/97 dead transitions. [2023-11-29 04:55:57,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 97 transitions, 460 flow [2023-11-29 04:55:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:55:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:55:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2023-11-29 04:55:57,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6149068322981367 [2023-11-29 04:55:57,049 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 198 transitions. [2023-11-29 04:55:57,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 198 transitions. [2023-11-29 04:55:57,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:55:57,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 198 transitions. [2023-11-29 04:55:57,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:57,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:57,052 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:57,053 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 132 flow. Second operand 7 states and 198 transitions. [2023-11-29 04:55:57,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 97 transitions, 460 flow [2023-11-29 04:55:57,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 97 transitions, 426 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-11-29 04:55:57,144 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 137 flow [2023-11-29 04:55:57,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2023-11-29 04:55:57,145 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2023-11-29 04:55:57,146 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 137 flow [2023-11-29 04:55:57,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:57,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:55:57,147 INFO L208 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] [2023-11-29 04:55:57,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:55:57,147 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)] === [2023-11-29 04:55:57,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1868224749, now seen corresponding path program 1 times [2023-11-29 04:55:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:57,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140591587] [2023-11-29 04:55:57,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140591587] [2023-11-29 04:55:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140591587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:55:57,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:55:57,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:55:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164892220] [2023-11-29 04:55:57,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:55:57,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:55:57,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:57,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:55:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:55:57,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:55:57,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 137 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:57,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:55:57,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:55:57,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:55:59,970 INFO L124 PetriNetUnfolderBase]: 5695/9062 cut-off events. [2023-11-29 04:55:59,970 INFO L125 PetriNetUnfolderBase]: For 7745/7772 co-relation queries the response was YES. [2023-11-29 04:55:59,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21202 conditions, 9062 events. 5695/9062 cut-off events. For 7745/7772 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 64887 event pairs, 2261 based on Foata normal form. 258/9168 useless extension candidates. Maximal degree in co-relation 21182. Up to 6221 conditions per place. [2023-11-29 04:56:00,076 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 44 selfloop transitions, 12 changer transitions 43/115 dead transitions. [2023-11-29 04:56:00,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 115 transitions, 528 flow [2023-11-29 04:56:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:56:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 04:56:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 300 transitions. [2023-11-29 04:56:00,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5928853754940712 [2023-11-29 04:56:00,079 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 300 transitions. [2023-11-29 04:56:00,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 300 transitions. [2023-11-29 04:56:00,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:00,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 300 transitions. [2023-11-29 04:56:00,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 27.272727272727273) internal successors, (300), 11 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:00,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 46.0) internal successors, (552), 12 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:00,082 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 46.0) internal successors, (552), 12 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:00,082 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 137 flow. Second operand 11 states and 300 transitions. [2023-11-29 04:56:00,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 115 transitions, 528 flow [2023-11-29 04:56:00,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 501 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-11-29 04:56:00,150 INFO L231 Difference]: Finished difference. Result has 74 places, 51 transitions, 221 flow [2023-11-29 04:56:00,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=221, PETRI_PLACES=74, PETRI_TRANSITIONS=51} [2023-11-29 04:56:00,151 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2023-11-29 04:56:00,152 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 51 transitions, 221 flow [2023-11-29 04:56:00,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:00,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:00,153 INFO L208 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] [2023-11-29 04:56:00,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:56:00,153 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)] === [2023-11-29 04:56:00,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1388031473, now seen corresponding path program 1 times [2023-11-29 04:56:00,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391779091] [2023-11-29 04:56:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:00,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391779091] [2023-11-29 04:56:00,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391779091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:00,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:00,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:56:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913006389] [2023-11-29 04:56:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:00,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:56:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:00,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:56:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:56:00,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2023-11-29 04:56:00,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 51 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:00,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:00,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2023-11-29 04:56:00,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:04,099 INFO L124 PetriNetUnfolderBase]: 12600/19310 cut-off events. [2023-11-29 04:56:04,099 INFO L125 PetriNetUnfolderBase]: For 31488/31520 co-relation queries the response was YES. [2023-11-29 04:56:04,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58931 conditions, 19310 events. 12600/19310 cut-off events. For 31488/31520 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 140949 event pairs, 1805 based on Foata normal form. 269/19498 useless extension candidates. Maximal degree in co-relation 58905. Up to 8182 conditions per place. [2023-11-29 04:56:04,202 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 73 selfloop transitions, 4 changer transitions 30/118 dead transitions. [2023-11-29 04:56:04,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 118 transitions, 753 flow [2023-11-29 04:56:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:56:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:56:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2023-11-29 04:56:04,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6195652173913043 [2023-11-29 04:56:04,205 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 171 transitions. [2023-11-29 04:56:04,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 171 transitions. [2023-11-29 04:56:04,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:04,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 171 transitions. [2023-11-29 04:56:04,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:04,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:04,208 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:04,208 INFO L175 Difference]: Start difference. First operand has 74 places, 51 transitions, 221 flow. Second operand 6 states and 171 transitions. [2023-11-29 04:56:04,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 118 transitions, 753 flow [2023-11-29 04:56:04,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 741 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-29 04:56:04,354 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 230 flow [2023-11-29 04:56:04,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-11-29 04:56:04,354 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2023-11-29 04:56:04,355 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 230 flow [2023-11-29 04:56:04,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:04,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:04,355 INFO L208 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] [2023-11-29 04:56:04,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:56:04,355 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)] === [2023-11-29 04:56:04,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash -65696847, now seen corresponding path program 2 times [2023-11-29 04:56:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:04,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925219835] [2023-11-29 04:56:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:05,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:05,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925219835] [2023-11-29 04:56:05,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925219835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:05,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:05,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:56:05,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995119897] [2023-11-29 04:56:05,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:05,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:56:05,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:56:05,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:56:05,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:56:05,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 230 flow. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:05,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:05,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:56:05,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:07,404 INFO L124 PetriNetUnfolderBase]: 5249/8517 cut-off events. [2023-11-29 04:56:07,404 INFO L125 PetriNetUnfolderBase]: For 16172/16338 co-relation queries the response was YES. [2023-11-29 04:56:07,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25723 conditions, 8517 events. 5249/8517 cut-off events. For 16172/16338 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 60795 event pairs, 3031 based on Foata normal form. 238/8608 useless extension candidates. Maximal degree in co-relation 25696. Up to 5755 conditions per place. [2023-11-29 04:56:07,457 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 50 selfloop transitions, 17 changer transitions 41/124 dead transitions. [2023-11-29 04:56:07,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 767 flow [2023-11-29 04:56:07,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:56:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 04:56:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 301 transitions. [2023-11-29 04:56:07,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5948616600790514 [2023-11-29 04:56:07,460 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 301 transitions. [2023-11-29 04:56:07,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 301 transitions. [2023-11-29 04:56:07,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:07,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 301 transitions. [2023-11-29 04:56:07,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 27.363636363636363) internal successors, (301), 11 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:07,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 46.0) internal successors, (552), 12 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:07,464 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 46.0) internal successors, (552), 12 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:07,465 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 230 flow. Second operand 11 states and 301 transitions. [2023-11-29 04:56:07,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 767 flow [2023-11-29 04:56:07,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 124 transitions, 743 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-29 04:56:07,496 INFO L231 Difference]: Finished difference. Result has 84 places, 59 transitions, 348 flow [2023-11-29 04:56:07,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=348, PETRI_PLACES=84, PETRI_TRANSITIONS=59} [2023-11-29 04:56:07,497 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2023-11-29 04:56:07,497 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 59 transitions, 348 flow [2023-11-29 04:56:07,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:07,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:07,497 INFO L208 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] [2023-11-29 04:56:07,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:56:07,497 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)] === [2023-11-29 04:56:07,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1452398507, now seen corresponding path program 1 times [2023-11-29 04:56:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:07,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407301450] [2023-11-29 04:56:07,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:07,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:07,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407301450] [2023-11-29 04:56:07,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407301450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:07,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:07,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:56:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818399592] [2023-11-29 04:56:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:07,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:56:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:56:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:56:07,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2023-11-29 04:56:07,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 59 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:07,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:07,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2023-11-29 04:56:07,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:11,123 INFO L124 PetriNetUnfolderBase]: 15405/22191 cut-off events. [2023-11-29 04:56:11,123 INFO L125 PetriNetUnfolderBase]: For 76115/76332 co-relation queries the response was YES. [2023-11-29 04:56:11,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78235 conditions, 22191 events. 15405/22191 cut-off events. For 76115/76332 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 144110 event pairs, 2011 based on Foata normal form. 748/22816 useless extension candidates. Maximal degree in co-relation 78202. Up to 12454 conditions per place. [2023-11-29 04:56:11,276 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 102 selfloop transitions, 6 changer transitions 1/121 dead transitions. [2023-11-29 04:56:11,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 121 transitions, 964 flow [2023-11-29 04:56:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:56:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:56:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2023-11-29 04:56:11,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2023-11-29 04:56:11,279 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 120 transitions. [2023-11-29 04:56:11,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 120 transitions. [2023-11-29 04:56:11,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:11,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 120 transitions. [2023-11-29 04:56:11,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:11,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:11,281 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:11,281 INFO L175 Difference]: Start difference. First operand has 84 places, 59 transitions, 348 flow. Second operand 4 states and 120 transitions. [2023-11-29 04:56:11,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 121 transitions, 964 flow [2023-11-29 04:56:11,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 868 flow, removed 42 selfloop flow, removed 7 redundant places. [2023-11-29 04:56:11,360 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 346 flow [2023-11-29 04:56:11,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2023-11-29 04:56:11,361 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places. [2023-11-29 04:56:11,361 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 346 flow [2023-11-29 04:56:11,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:11,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:11,361 INFO L208 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] [2023-11-29 04:56:11,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:56:11,362 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)] === [2023-11-29 04:56:11,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1559834476, now seen corresponding path program 1 times [2023-11-29 04:56:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:11,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164151874] [2023-11-29 04:56:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164151874] [2023-11-29 04:56:11,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164151874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:11,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:11,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:56:11,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595525932] [2023-11-29 04:56:11,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:11,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:56:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:11,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:56:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:56:11,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2023-11-29 04:56:11,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:11,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:11,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2023-11-29 04:56:11,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:15,638 INFO L124 PetriNetUnfolderBase]: 17186/25873 cut-off events. [2023-11-29 04:56:15,638 INFO L125 PetriNetUnfolderBase]: For 40065/40396 co-relation queries the response was YES. [2023-11-29 04:56:15,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81692 conditions, 25873 events. 17186/25873 cut-off events. For 40065/40396 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 192011 event pairs, 5342 based on Foata normal form. 249/24736 useless extension candidates. Maximal degree in co-relation 81662. Up to 8093 conditions per place. [2023-11-29 04:56:16,017 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 125 selfloop transitions, 5 changer transitions 24/169 dead transitions. [2023-11-29 04:56:16,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 169 transitions, 1242 flow [2023-11-29 04:56:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:56:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:56:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2023-11-29 04:56:16,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6149068322981367 [2023-11-29 04:56:16,019 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 198 transitions. [2023-11-29 04:56:16,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 198 transitions. [2023-11-29 04:56:16,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:16,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 198 transitions. [2023-11-29 04:56:16,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 28.285714285714285) internal successors, (198), 7 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:16,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:16,023 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:16,023 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 346 flow. Second operand 7 states and 198 transitions. [2023-11-29 04:56:16,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 169 transitions, 1242 flow [2023-11-29 04:56:16,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 169 transitions, 1227 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 04:56:16,050 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 368 flow [2023-11-29 04:56:16,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2023-11-29 04:56:16,051 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2023-11-29 04:56:16,052 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 368 flow [2023-11-29 04:56:16,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:16,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:16,052 INFO L208 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] [2023-11-29 04:56:16,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:56:16,052 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)] === [2023-11-29 04:56:16,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash -507551064, now seen corresponding path program 2 times [2023-11-29 04:56:16,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:16,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022363974] [2023-11-29 04:56:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:16,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022363974] [2023-11-29 04:56:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022363974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:56:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862500457] [2023-11-29 04:56:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:17,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:56:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:56:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:56:17,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:56:17,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 65 transitions, 368 flow. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:17,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:17,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:56:17,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:22,099 INFO L124 PetriNetUnfolderBase]: 16778/25414 cut-off events. [2023-11-29 04:56:22,100 INFO L125 PetriNetUnfolderBase]: For 42389/42982 co-relation queries the response was YES. [2023-11-29 04:56:22,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79488 conditions, 25414 events. 16778/25414 cut-off events. For 42389/42982 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 192183 event pairs, 9931 based on Foata normal form. 484/23931 useless extension candidates. Maximal degree in co-relation 79455. Up to 15324 conditions per place. [2023-11-29 04:56:22,267 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 92 selfloop transitions, 34 changer transitions 0/148 dead transitions. [2023-11-29 04:56:22,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 148 transitions, 1000 flow [2023-11-29 04:56:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:56:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 04:56:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 308 transitions. [2023-11-29 04:56:22,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2023-11-29 04:56:22,270 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 308 transitions. [2023-11-29 04:56:22,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 308 transitions. [2023-11-29 04:56:22,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:22,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 308 transitions. [2023-11-29 04:56:22,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 28.0) internal successors, (308), 11 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:22,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 46.0) internal successors, (552), 12 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:22,273 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 46.0) internal successors, (552), 12 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:22,273 INFO L175 Difference]: Start difference. First operand has 84 places, 65 transitions, 368 flow. Second operand 11 states and 308 transitions. [2023-11-29 04:56:22,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 148 transitions, 1000 flow [2023-11-29 04:56:22,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 983 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:56:22,341 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 661 flow [2023-11-29 04:56:22,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=661, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2023-11-29 04:56:22,342 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2023-11-29 04:56:22,342 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 661 flow [2023-11-29 04:56:22,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:22,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:22,342 INFO L208 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] [2023-11-29 04:56:22,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:56:22,343 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)] === [2023-11-29 04:56:22,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:22,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1276943586, now seen corresponding path program 1 times [2023-11-29 04:56:22,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248779397] [2023-11-29 04:56:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248779397] [2023-11-29 04:56:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248779397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:22,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:22,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:56:22,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695887810] [2023-11-29 04:56:22,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:22,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:56:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:56:22,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:56:22,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2023-11-29 04:56:22,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 661 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:22,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:22,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2023-11-29 04:56:22,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:28,258 INFO L124 PetriNetUnfolderBase]: 23936/33790 cut-off events. [2023-11-29 04:56:28,258 INFO L125 PetriNetUnfolderBase]: For 144696/145711 co-relation queries the response was YES. [2023-11-29 04:56:28,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130513 conditions, 33790 events. 23936/33790 cut-off events. For 144696/145711 co-relation queries the response was YES. Maximal size of possible extension queue 1531. Compared 218717 event pairs, 1756 based on Foata normal form. 1566/34950 useless extension candidates. Maximal degree in co-relation 130476. Up to 15461 conditions per place. [2023-11-29 04:56:28,459 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 133 selfloop transitions, 10 changer transitions 16/173 dead transitions. [2023-11-29 04:56:28,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 1650 flow [2023-11-29 04:56:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:56:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:56:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2023-11-29 04:56:28,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6608695652173913 [2023-11-29 04:56:28,461 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 152 transitions. [2023-11-29 04:56:28,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 152 transitions. [2023-11-29 04:56:28,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:28,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 152 transitions. [2023-11-29 04:56:28,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:28,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:28,463 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:28,463 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 661 flow. Second operand 5 states and 152 transitions. [2023-11-29 04:56:28,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 1650 flow [2023-11-29 04:56:28,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 173 transitions, 1553 flow, removed 42 selfloop flow, removed 1 redundant places. [2023-11-29 04:56:28,580 INFO L231 Difference]: Finished difference. Result has 98 places, 75 transitions, 534 flow [2023-11-29 04:56:28,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=534, PETRI_PLACES=98, PETRI_TRANSITIONS=75} [2023-11-29 04:56:28,581 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 44 predicate places. [2023-11-29 04:56:28,581 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 534 flow [2023-11-29 04:56:28,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:28,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:28,582 INFO L208 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] [2023-11-29 04:56:28,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:56:28,582 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)] === [2023-11-29 04:56:28,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1793776775, now seen corresponding path program 1 times [2023-11-29 04:56:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:28,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171913859] [2023-11-29 04:56:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:28,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:28,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171913859] [2023-11-29 04:56:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171913859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:28,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:56:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26869264] [2023-11-29 04:56:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:28,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:56:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:56:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:56:28,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2023-11-29 04:56:28,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:28,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:28,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2023-11-29 04:56:28,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:32,692 INFO L124 PetriNetUnfolderBase]: 14848/21022 cut-off events. [2023-11-29 04:56:32,692 INFO L125 PetriNetUnfolderBase]: For 90839/91769 co-relation queries the response was YES. [2023-11-29 04:56:32,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84828 conditions, 21022 events. 14848/21022 cut-off events. For 90839/91769 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 126813 event pairs, 816 based on Foata normal form. 1088/21823 useless extension candidates. Maximal degree in co-relation 84788. Up to 6760 conditions per place. [2023-11-29 04:56:32,818 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 133 selfloop transitions, 14 changer transitions 3/164 dead transitions. [2023-11-29 04:56:32,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 164 transitions, 1483 flow [2023-11-29 04:56:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:56:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:56:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2023-11-29 04:56:32,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 04:56:32,820 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 184 transitions. [2023-11-29 04:56:32,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 184 transitions. [2023-11-29 04:56:32,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:32,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 184 transitions. [2023-11-29 04:56:32,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:32,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:32,823 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:32,823 INFO L175 Difference]: Start difference. First operand has 98 places, 75 transitions, 534 flow. Second operand 6 states and 184 transitions. [2023-11-29 04:56:32,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 164 transitions, 1483 flow [2023-11-29 04:56:33,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 164 transitions, 1360 flow, removed 44 selfloop flow, removed 9 redundant places. [2023-11-29 04:56:33,004 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 538 flow [2023-11-29 04:56:33,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2023-11-29 04:56:33,005 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2023-11-29 04:56:33,006 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 538 flow [2023-11-29 04:56:33,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:33,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:33,006 INFO L208 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] [2023-11-29 04:56:33,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:56:33,006 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)] === [2023-11-29 04:56:33,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash -356851988, now seen corresponding path program 1 times [2023-11-29 04:56:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:33,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004848433] [2023-11-29 04:56:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:33,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004848433] [2023-11-29 04:56:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004848433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:56:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667494743] [2023-11-29 04:56:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:33,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:56:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:33,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:56:33,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:56:33,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2023-11-29 04:56:33,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:33,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:33,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2023-11-29 04:56:33,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:35,937 INFO L124 PetriNetUnfolderBase]: 10356/14518 cut-off events. [2023-11-29 04:56:35,937 INFO L125 PetriNetUnfolderBase]: For 51344/52073 co-relation queries the response was YES. [2023-11-29 04:56:35,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57708 conditions, 14518 events. 10356/14518 cut-off events. For 51344/52073 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 82878 event pairs, 530 based on Foata normal form. 468/14715 useless extension candidates. Maximal degree in co-relation 57672. Up to 4788 conditions per place. [2023-11-29 04:56:36,010 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 111 selfloop transitions, 18 changer transitions 15/158 dead transitions. [2023-11-29 04:56:36,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 1331 flow [2023-11-29 04:56:36,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:56:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:56:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2023-11-29 04:56:36,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6024844720496895 [2023-11-29 04:56:36,011 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 194 transitions. [2023-11-29 04:56:36,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 194 transitions. [2023-11-29 04:56:36,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:36,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 194 transitions. [2023-11-29 04:56:36,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 27.714285714285715) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:36,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:36,014 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:36,015 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 538 flow. Second operand 7 states and 194 transitions. [2023-11-29 04:56:36,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 1331 flow [2023-11-29 04:56:36,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 158 transitions, 1217 flow, removed 21 selfloop flow, removed 10 redundant places. [2023-11-29 04:56:36,334 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 484 flow [2023-11-29 04:56:36,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2023-11-29 04:56:36,335 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places. [2023-11-29 04:56:36,335 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 484 flow [2023-11-29 04:56:36,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:36,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:36,335 INFO L208 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] [2023-11-29 04:56:36,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:56:36,336 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)] === [2023-11-29 04:56:36,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:36,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1760417995, now seen corresponding path program 1 times [2023-11-29 04:56:36,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:36,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715600914] [2023-11-29 04:56:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:36,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:39,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715600914] [2023-11-29 04:56:39,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715600914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:39,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:39,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:56:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681945615] [2023-11-29 04:56:39,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:39,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:56:39,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:39,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:56:39,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:56:39,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:56:39,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 484 flow. Second operand has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:39,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:39,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:56:39,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:43,470 INFO L124 PetriNetUnfolderBase]: 12592/20699 cut-off events. [2023-11-29 04:56:43,470 INFO L125 PetriNetUnfolderBase]: For 42074/44104 co-relation queries the response was YES. [2023-11-29 04:56:43,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67672 conditions, 20699 events. 12592/20699 cut-off events. For 42074/44104 co-relation queries the response was YES. Maximal size of possible extension queue 1528. Compared 168175 event pairs, 3204 based on Foata normal form. 80/19113 useless extension candidates. Maximal degree in co-relation 67640. Up to 7024 conditions per place. [2023-11-29 04:56:43,593 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 97 selfloop transitions, 22 changer transitions 49/198 dead transitions. [2023-11-29 04:56:43,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 198 transitions, 1321 flow [2023-11-29 04:56:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:56:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-29 04:56:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 475 transitions. [2023-11-29 04:56:43,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5736714975845411 [2023-11-29 04:56:43,596 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 475 transitions. [2023-11-29 04:56:43,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 475 transitions. [2023-11-29 04:56:43,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:43,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 475 transitions. [2023-11-29 04:56:43,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 26.38888888888889) internal successors, (475), 18 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:43,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 46.0) internal successors, (874), 19 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:43,601 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 46.0) internal successors, (874), 19 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:43,601 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 484 flow. Second operand 18 states and 475 transitions. [2023-11-29 04:56:43,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 198 transitions, 1321 flow [2023-11-29 04:56:44,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 198 transitions, 1099 flow, removed 75 selfloop flow, removed 14 redundant places. [2023-11-29 04:56:44,116 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 600 flow [2023-11-29 04:56:44,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=600, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2023-11-29 04:56:44,117 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2023-11-29 04:56:44,117 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 600 flow [2023-11-29 04:56:44,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:44,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:44,117 INFO L208 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] [2023-11-29 04:56:44,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:56:44,117 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)] === [2023-11-29 04:56:44,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2049538941, now seen corresponding path program 2 times [2023-11-29 04:56:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43660073] [2023-11-29 04:56:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:45,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:45,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43660073] [2023-11-29 04:56:45,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43660073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:45,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:45,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:56:45,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643445563] [2023-11-29 04:56:45,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:45,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:56:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:45,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:56:45,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:56:45,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:56:45,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:45,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:45,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:56:45,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:49,666 INFO L124 PetriNetUnfolderBase]: 18129/30054 cut-off events. [2023-11-29 04:56:49,667 INFO L125 PetriNetUnfolderBase]: For 32283/33897 co-relation queries the response was YES. [2023-11-29 04:56:49,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79160 conditions, 30054 events. 18129/30054 cut-off events. For 32283/33897 co-relation queries the response was YES. Maximal size of possible extension queue 2395. Compared 263376 event pairs, 6015 based on Foata normal form. 97/27662 useless extension candidates. Maximal degree in co-relation 79126. Up to 13899 conditions per place. [2023-11-29 04:56:49,858 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 84 selfloop transitions, 23 changer transitions 26/163 dead transitions. [2023-11-29 04:56:49,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 163 transitions, 1126 flow [2023-11-29 04:56:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:56:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:56:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 259 transitions. [2023-11-29 04:56:49,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6256038647342995 [2023-11-29 04:56:49,860 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 259 transitions. [2023-11-29 04:56:49,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 259 transitions. [2023-11-29 04:56:49,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:49,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 259 transitions. [2023-11-29 04:56:49,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:49,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:49,862 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:49,862 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 600 flow. Second operand 9 states and 259 transitions. [2023-11-29 04:56:49,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 163 transitions, 1126 flow [2023-11-29 04:56:49,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 163 transitions, 1017 flow, removed 53 selfloop flow, removed 7 redundant places. [2023-11-29 04:56:49,975 INFO L231 Difference]: Finished difference. Result has 103 places, 105 transitions, 673 flow [2023-11-29 04:56:49,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=673, PETRI_PLACES=103, PETRI_TRANSITIONS=105} [2023-11-29 04:56:49,976 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places. [2023-11-29 04:56:49,976 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 105 transitions, 673 flow [2023-11-29 04:56:49,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:49,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:49,977 INFO L208 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] [2023-11-29 04:56:49,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:56:49,977 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)] === [2023-11-29 04:56:49,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1175252439, now seen corresponding path program 3 times [2023-11-29 04:56:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:49,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486833006] [2023-11-29 04:56:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:51,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486833006] [2023-11-29 04:56:51,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486833006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:51,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:51,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:56:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631177601] [2023-11-29 04:56:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:51,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:56:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:56:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:56:51,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:56:51,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 105 transitions, 673 flow. Second operand has 10 states, 10 states have (on average 20.0) internal successors, (200), 10 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:51,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:51,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:56:51,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:56:57,117 INFO L124 PetriNetUnfolderBase]: 24392/40703 cut-off events. [2023-11-29 04:56:57,117 INFO L125 PetriNetUnfolderBase]: For 47135/48390 co-relation queries the response was YES. [2023-11-29 04:56:57,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106177 conditions, 40703 events. 24392/40703 cut-off events. For 47135/48390 co-relation queries the response was YES. Maximal size of possible extension queue 3373. Compared 377524 event pairs, 10342 based on Foata normal form. 146/37047 useless extension candidates. Maximal degree in co-relation 106142. Up to 17061 conditions per place. [2023-11-29 04:56:57,359 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 83 selfloop transitions, 28 changer transitions 20/161 dead transitions. [2023-11-29 04:56:57,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 161 transitions, 1158 flow [2023-11-29 04:56:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:56:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:56:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 246 transitions. [2023-11-29 04:56:57,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2023-11-29 04:56:57,361 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 246 transitions. [2023-11-29 04:56:57,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 246 transitions. [2023-11-29 04:56:57,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:56:57,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 246 transitions. [2023-11-29 04:56:57,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:57,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:57,364 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:57,364 INFO L175 Difference]: Start difference. First operand has 103 places, 105 transitions, 673 flow. Second operand 9 states and 246 transitions. [2023-11-29 04:56:57,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 161 transitions, 1158 flow [2023-11-29 04:56:57,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 161 transitions, 1104 flow, removed 27 selfloop flow, removed 2 redundant places. [2023-11-29 04:56:57,525 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 812 flow [2023-11-29 04:56:57,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2023-11-29 04:56:57,526 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2023-11-29 04:56:57,526 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 812 flow [2023-11-29 04:56:57,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.0) internal successors, (200), 10 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:57,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:56:57,526 INFO L208 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] [2023-11-29 04:56:57,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:56:57,527 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)] === [2023-11-29 04:56:57,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash 87195477, now seen corresponding path program 4 times [2023-11-29 04:56:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:56:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803435156] [2023-11-29 04:56:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:56:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:56:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:59,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803435156] [2023-11-29 04:56:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803435156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:56:59,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:56:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:56:59,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648908670] [2023-11-29 04:56:59,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:56:59,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:56:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:56:59,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:56:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:56:59,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:56:59,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 812 flow. Second operand has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:56:59,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:56:59,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:56:59,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:57:06,587 INFO L124 PetriNetUnfolderBase]: 29946/50107 cut-off events. [2023-11-29 04:57:06,587 INFO L125 PetriNetUnfolderBase]: For 68672/69939 co-relation queries the response was YES. [2023-11-29 04:57:06,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132142 conditions, 50107 events. 29946/50107 cut-off events. For 68672/69939 co-relation queries the response was YES. Maximal size of possible extension queue 4232. Compared 479932 event pairs, 10351 based on Foata normal form. 208/45620 useless extension candidates. Maximal degree in co-relation 132101. Up to 18409 conditions per place. [2023-11-29 04:57:06,905 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 91 selfloop transitions, 21 changer transitions 28/170 dead transitions. [2023-11-29 04:57:06,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 170 transitions, 1352 flow [2023-11-29 04:57:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:57:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:57:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 250 transitions. [2023-11-29 04:57:06,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6038647342995169 [2023-11-29 04:57:06,907 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 250 transitions. [2023-11-29 04:57:06,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 250 transitions. [2023-11-29 04:57:06,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:57:06,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 250 transitions. [2023-11-29 04:57:06,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:06,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:06,910 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:06,910 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 812 flow. Second operand 9 states and 250 transitions. [2023-11-29 04:57:06,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 170 transitions, 1352 flow [2023-11-29 04:57:07,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 170 transitions, 1290 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-11-29 04:57:07,527 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 835 flow [2023-11-29 04:57:07,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=835, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2023-11-29 04:57:07,527 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 66 predicate places. [2023-11-29 04:57:07,527 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 835 flow [2023-11-29 04:57:07,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.818181818181817) internal successors, (218), 11 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:07,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:57:07,528 INFO L208 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] [2023-11-29 04:57:07,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:57:07,528 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)] === [2023-11-29 04:57:07,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -794321337, now seen corresponding path program 5 times [2023-11-29 04:57:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:07,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809727357] [2023-11-29 04:57:07,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809727357] [2023-11-29 04:57:10,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809727357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:10,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:10,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:57:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300213295] [2023-11-29 04:57:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:10,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:57:10,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:57:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:57:10,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:57:10,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 835 flow. Second operand has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:10,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:57:10,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:57:10,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:57:17,480 INFO L124 PetriNetUnfolderBase]: 28912/48459 cut-off events. [2023-11-29 04:57:17,480 INFO L125 PetriNetUnfolderBase]: For 73968/75369 co-relation queries the response was YES. [2023-11-29 04:57:17,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129026 conditions, 48459 events. 28912/48459 cut-off events. For 73968/75369 co-relation queries the response was YES. Maximal size of possible extension queue 4080. Compared 464116 event pairs, 11564 based on Foata normal form. 199/43938 useless extension candidates. Maximal degree in co-relation 128982. Up to 28836 conditions per place. [2023-11-29 04:57:17,813 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 102 selfloop transitions, 18 changer transitions 15/165 dead transitions. [2023-11-29 04:57:17,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 165 transitions, 1318 flow [2023-11-29 04:57:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:57:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:57:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 265 transitions. [2023-11-29 04:57:17,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2023-11-29 04:57:17,814 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 265 transitions. [2023-11-29 04:57:17,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 265 transitions. [2023-11-29 04:57:17,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:57:17,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 265 transitions. [2023-11-29 04:57:17,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 26.5) internal successors, (265), 10 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:17,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 46.0) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:17,817 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 46.0) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:17,817 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 835 flow. Second operand 10 states and 265 transitions. [2023-11-29 04:57:17,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 165 transitions, 1318 flow [2023-11-29 04:57:18,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 165 transitions, 1233 flow, removed 23 selfloop flow, removed 10 redundant places. [2023-11-29 04:57:18,618 INFO L231 Difference]: Finished difference. Result has 120 places, 118 transitions, 904 flow [2023-11-29 04:57:18,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=904, PETRI_PLACES=120, PETRI_TRANSITIONS=118} [2023-11-29 04:57:18,618 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 66 predicate places. [2023-11-29 04:57:18,619 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 118 transitions, 904 flow [2023-11-29 04:57:18,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:18,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:57:18,619 INFO L208 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] [2023-11-29 04:57:18,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:57:18,619 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)] === [2023-11-29 04:57:18,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1907285371, now seen corresponding path program 6 times [2023-11-29 04:57:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467161615] [2023-11-29 04:57:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:21,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:21,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467161615] [2023-11-29 04:57:21,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467161615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:21,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:21,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:57:21,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365249447] [2023-11-29 04:57:21,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:21,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:57:21,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:21,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:57:21,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:57:21,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:57:21,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 118 transitions, 904 flow. Second operand has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:21,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:57:21,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:57:21,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:57:29,059 INFO L124 PetriNetUnfolderBase]: 31636/53155 cut-off events. [2023-11-29 04:57:29,060 INFO L125 PetriNetUnfolderBase]: For 74169/75738 co-relation queries the response was YES. [2023-11-29 04:57:29,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140814 conditions, 53155 events. 31636/53155 cut-off events. For 74169/75738 co-relation queries the response was YES. Maximal size of possible extension queue 4514. Compared 517589 event pairs, 13018 based on Foata normal form. 245/48230 useless extension candidates. Maximal degree in co-relation 140772. Up to 29836 conditions per place. [2023-11-29 04:57:29,449 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 101 selfloop transitions, 15 changer transitions 25/171 dead transitions. [2023-11-29 04:57:29,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 171 transitions, 1417 flow [2023-11-29 04:57:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:57:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:57:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 260 transitions. [2023-11-29 04:57:29,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2023-11-29 04:57:29,451 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 260 transitions. [2023-11-29 04:57:29,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 260 transitions. [2023-11-29 04:57:29,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:57:29,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 260 transitions. [2023-11-29 04:57:29,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:29,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 46.0) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:29,454 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 46.0) internal successors, (506), 11 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:29,454 INFO L175 Difference]: Start difference. First operand has 120 places, 118 transitions, 904 flow. Second operand 10 states and 260 transitions. [2023-11-29 04:57:29,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 171 transitions, 1417 flow [2023-11-29 04:57:30,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 171 transitions, 1361 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-29 04:57:30,292 INFO L231 Difference]: Finished difference. Result has 128 places, 120 transitions, 961 flow [2023-11-29 04:57:30,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=961, PETRI_PLACES=128, PETRI_TRANSITIONS=120} [2023-11-29 04:57:30,292 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 74 predicate places. [2023-11-29 04:57:30,293 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 120 transitions, 961 flow [2023-11-29 04:57:30,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:30,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:57:30,293 INFO L208 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] [2023-11-29 04:57:30,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:57:30,293 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)] === [2023-11-29 04:57:30,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1827612049, now seen corresponding path program 7 times [2023-11-29 04:57:30,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:30,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264670910] [2023-11-29 04:57:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:32,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264670910] [2023-11-29 04:57:32,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264670910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:32,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:32,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:57:32,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992984218] [2023-11-29 04:57:32,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:32,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:57:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:32,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:57:32,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:57:32,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:57:32,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 120 transitions, 961 flow. Second operand has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:32,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:57:32,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:57:32,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:57:40,550 INFO L124 PetriNetUnfolderBase]: 31257/52525 cut-off events. [2023-11-29 04:57:40,550 INFO L125 PetriNetUnfolderBase]: For 88185/89885 co-relation queries the response was YES. [2023-11-29 04:57:40,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142490 conditions, 52525 events. 31257/52525 cut-off events. For 88185/89885 co-relation queries the response was YES. Maximal size of possible extension queue 4414. Compared 509379 event pairs, 10315 based on Foata normal form. 405/48249 useless extension candidates. Maximal degree in co-relation 142443. Up to 18272 conditions per place. [2023-11-29 04:57:40,955 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 99 selfloop transitions, 27 changer transitions 25/181 dead transitions. [2023-11-29 04:57:40,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 181 transitions, 1591 flow [2023-11-29 04:57:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:57:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 04:57:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions. [2023-11-29 04:57:40,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2023-11-29 04:57:40,958 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 253 transitions. [2023-11-29 04:57:40,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 253 transitions. [2023-11-29 04:57:40,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:57:40,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 253 transitions. [2023-11-29 04:57:40,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:40,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:40,961 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 46.0) internal successors, (460), 10 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:40,961 INFO L175 Difference]: Start difference. First operand has 128 places, 120 transitions, 961 flow. Second operand 9 states and 253 transitions. [2023-11-29 04:57:40,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 181 transitions, 1591 flow [2023-11-29 04:57:41,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 181 transitions, 1523 flow, removed 27 selfloop flow, removed 7 redundant places. [2023-11-29 04:57:41,665 INFO L231 Difference]: Finished difference. Result has 131 places, 114 transitions, 964 flow [2023-11-29 04:57:41,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=964, PETRI_PLACES=131, PETRI_TRANSITIONS=114} [2023-11-29 04:57:41,666 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 77 predicate places. [2023-11-29 04:57:41,667 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 114 transitions, 964 flow [2023-11-29 04:57:41,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:41,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:57:41,668 INFO L208 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] [2023-11-29 04:57:41,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 04:57:41,668 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)] === [2023-11-29 04:57:41,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash -738091119, now seen corresponding path program 8 times [2023-11-29 04:57:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714031032] [2023-11-29 04:57:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:57:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:57:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714031032] [2023-11-29 04:57:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714031032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:57:44,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:57:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 04:57:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269355054] [2023-11-29 04:57:44,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:57:44,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:57:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:57:44,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:57:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:57:44,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2023-11-29 04:57:44,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 114 transitions, 964 flow. Second operand has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:44,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:57:44,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2023-11-29 04:57:44,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:57:52,127 INFO L124 PetriNetUnfolderBase]: 29630/49825 cut-off events. [2023-11-29 04:57:52,127 INFO L125 PetriNetUnfolderBase]: For 112521/113820 co-relation queries the response was YES. [2023-11-29 04:57:52,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141730 conditions, 49825 events. 29630/49825 cut-off events. For 112521/113820 co-relation queries the response was YES. Maximal size of possible extension queue 4191. Compared 478848 event pairs, 12150 based on Foata normal form. 150/45455 useless extension candidates. Maximal degree in co-relation 141682. Up to 29367 conditions per place. [2023-11-29 04:57:52,503 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 103 selfloop transitions, 16 changer transitions 24/173 dead transitions. [2023-11-29 04:57:52,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 173 transitions, 1518 flow [2023-11-29 04:57:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:57:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 04:57:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 286 transitions. [2023-11-29 04:57:52,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2023-11-29 04:57:52,505 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 286 transitions. [2023-11-29 04:57:52,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 286 transitions. [2023-11-29 04:57:52,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:57:52,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 286 transitions. [2023-11-29 04:57:52,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 26.0) internal successors, (286), 11 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:52,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 46.0) internal successors, (552), 12 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:52,508 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 46.0) internal successors, (552), 12 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:52,508 INFO L175 Difference]: Start difference. First operand has 131 places, 114 transitions, 964 flow. Second operand 11 states and 286 transitions. [2023-11-29 04:57:52,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 173 transitions, 1518 flow [2023-11-29 04:57:53,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 173 transitions, 1438 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-11-29 04:57:53,269 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 993 flow [2023-11-29 04:57:53,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=993, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2023-11-29 04:57:53,270 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 76 predicate places. [2023-11-29 04:57:53,270 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 993 flow [2023-11-29 04:57:53,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:57:53,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:57:53,270 INFO L208 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] [2023-11-29 04:57:53,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 04:57:53,270 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)] === [2023-11-29 04:57:53,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1257021027, now seen corresponding path program 9 times [2023-11-29 04:57:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:57:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027061630] [2023-11-29 04:57:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:57:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:57:53,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:57:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:57:53,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:57:53,484 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:57:53,485 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-29 04:57:53,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-29 04:57:53,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-29 04:57:53,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-29 04:57:53,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-29 04:57:53,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-29 04:57:53,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-29 04:57:53,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 04:57:53,489 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:53,497 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:57:53,497 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:57:53,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated [2023-11-29 04:57:53,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre38 could not be translated [2023-11-29 04:57:53,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre40 could not be translated [2023-11-29 04:57:53,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre42 could not be translated [2023-11-29 04:57:53,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:57:53 BasicIcfg [2023-11-29 04:57:53,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:57:53,636 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:57:53,636 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:57:53,637 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:57:53,637 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:55:44" (3/4) ... [2023-11-29 04:57:53,638 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 04:57:53,696 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated [2023-11-29 04:57:53,697 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre38 could not be translated [2023-11-29 04:57:53,698 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre40 could not be translated [2023-11-29 04:57:53,699 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre42 could not be translated [2023-11-29 04:57:53,804 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:57:53,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:57:53,805 INFO L158 Benchmark]: Toolchain (without parser) took 131088.95ms. Allocated memory was 157.3MB in the beginning and 9.4GB in the end (delta: 9.2GB). Free memory was 110.7MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-11-29 04:57:53,805 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 111.1MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:57:53,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.04ms. Allocated memory is still 157.3MB. Free memory was 110.7MB in the beginning and 84.3MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 04:57:53,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.51ms. Allocated memory is still 157.3MB. Free memory was 84.3MB in the beginning and 81.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:57:53,807 INFO L158 Benchmark]: Boogie Preprocessor took 78.51ms. Allocated memory is still 157.3MB. Free memory was 81.4MB in the beginning and 76.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:57:53,807 INFO L158 Benchmark]: RCFGBuilder took 1220.06ms. Allocated memory is still 157.3MB. Free memory was 76.4MB in the beginning and 73.9MB in the end (delta: 2.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-11-29 04:57:53,808 INFO L158 Benchmark]: TraceAbstraction took 128942.02ms. Allocated memory was 157.3MB in the beginning and 9.4GB in the end (delta: 9.2GB). Free memory was 73.9MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-11-29 04:57:53,808 INFO L158 Benchmark]: Witness Printer took 168.05ms. Allocated memory is still 9.4GB. Free memory was 5.7GB in the beginning and 5.6GB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-29 04:57:53,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 111.1MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.04ms. Allocated memory is still 157.3MB. Free memory was 110.7MB in the beginning and 84.3MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.51ms. Allocated memory is still 157.3MB. Free memory was 84.3MB in the beginning and 81.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.51ms. Allocated memory is still 157.3MB. Free memory was 81.4MB in the beginning and 76.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1220.06ms. Allocated memory is still 157.3MB. Free memory was 76.4MB in the beginning and 73.9MB in the end (delta: 2.5MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 128942.02ms. Allocated memory was 157.3MB in the beginning and 9.4GB in the end (delta: 9.2GB). Free memory was 73.9MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 168.05ms. Allocated memory is still 9.4GB. Free memory was 5.7GB in the beginning and 5.6GB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre42 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre42 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L882] 0 pthread_t t2229; [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$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, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={6: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$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, x={3:0}, y=0] [L884] 0 pthread_t t2230; [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$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, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={6:0}, t2230={7: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$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, x={3:0}, y=0] [L886] 0 pthread_t t2231; [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$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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={6:0}, t2230={7:0}, t2231={8: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$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, x={3:0}, y=0] [L888] 0 pthread_t t2232; [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$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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={6:0}, t2230={7:0}, t2231={8:0}, t2232={5: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$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, x={3: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$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, __unbuffered_p2_EAX=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=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=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, x={3: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 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] 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$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, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=0] [L840] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=1] [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=0, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=1] [L857] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, 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=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, 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=1, weak$$choice1=0, weak$$choice2=1, 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, x={3: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 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$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, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=1, 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, x={3: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$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, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=1, 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, x={3: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] 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$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, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L850] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L814] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L867] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, 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$$choice1=0, weak$$choice2=1, 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, x={3: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$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, __unbuffered_p2_EAX=1, 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={6:0}, t2230={7:0}, t2231={8:0}, t2232={5:0}, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L893] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [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$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, __unbuffered_p2_EAX=1, 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={6:0}, t2230={7:0}, t2231={8:0}, t2232={5:0}, weak$$choice1=0, weak$$choice2=1, 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, x={3: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 \read(*__unbuffered_p2_EAX$read_delayed_var) [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$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, __unbuffered_p2_EAX=1, 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={6:0}, t2230={7:0}, t2231={8:0}, t2232={5:0}, weak$$choice1=1, weak$$choice2=1, 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, x={3:0}, y=2] [L906] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, 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, x={3:0}, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=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, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, 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, x={3:0}, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 889]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 883]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 77 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: 128.6s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 103.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1486 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1449 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 335 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6617 IncrementalHoareTripleChecker+Invalid, 6801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 29 mSDtfsCounter, 6617 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=993occurred in iteration=22, InterpolantAutomatonStates: 185, 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 614 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 8688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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! [2023-11-29 04:57:53,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34bfbe54-aeac-4432-94d6-eee26506c7eb/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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