./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu --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 d5772eac83993f999ed7a0d2c72e283c734e18136b4020af8f8e407255c20c04 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:01:45,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:01:45,173 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:01:45,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:01:45,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:01:45,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:01:45,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:01:45,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:01:45,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:01:45,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:01:45,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:01:45,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:01:45,233 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:01:45,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:01:45,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:01:45,235 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:01:45,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:01:45,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:01:45,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:01:45,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:01:45,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:01:45,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:01:45,239 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:01:45,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:01:45,240 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:01:45,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:01:45,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:01:45,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:01:45,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:45,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:01:45,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:01:45,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:01:45,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:01:45,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:01:45,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:01:45,260 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:01:45,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:01:45,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:01:45,261 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:01:45,261 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_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/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_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu 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 -> d5772eac83993f999ed7a0d2c72e283c734e18136b4020af8f8e407255c20c04 [2023-11-19 08:01:45,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:01:45,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:01:45,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:01:45,606 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:01:45,607 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:01:45,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i [2023-11-19 08:01:48,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:01:49,145 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:01:49,145 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i [2023-11-19 08:01:49,177 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/data/666df27ef/484ea26b35e04f91bcb775f1b1ba178c/FLAGae9d7a5f5 [2023-11-19 08:01:49,193 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/data/666df27ef/484ea26b35e04f91bcb775f1b1ba178c [2023-11-19 08:01:49,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:01:49,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:01:49,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:49,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:01:49,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:01:49,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe0d02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49, skipping insertion in model container [2023-11-19 08:01:49,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,293 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:01:49,460 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_407c0b9e-7b27-4e59-a414-f90b1e73e904/sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2023-11-19 08:01:49,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:49,840 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:01:49,853 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_407c0b9e-7b27-4e59-a414-f90b1e73e904/sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2023-11-19 08:01:49,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:49,947 WARN L675 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:01:49,955 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:01:49,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49 WrapperNode [2023-11-19 08:01:49,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:49,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:49,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:01:49,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:01:49,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,020 INFO L138 Inliner]: procedures = 271, calls = 45, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-11-19 08:01:50,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:50,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:01:50,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:01:50,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:01:50,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:01:50,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:01:50,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:01:50,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:01:50,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:50,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:50,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:50,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:01:50,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407c0b9e-7b27-4e59-a414-f90b1e73e904/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:01:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-11-19 08:01:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:01:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2023-11-19 08:01:50,171 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2023-11-19 08:01:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:01:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:01:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-19 08:01:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:01:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2023-11-19 08:01:50,172 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2023-11-19 08:01:50,172 INFO L130 BoogieDeclarations]: Found specification of procedure process [2023-11-19 08:01:50,173 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2023-11-19 08:01:50,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:01:50,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:01:50,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:01:50,175 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:01:50,495 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:01:50,497 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:01:50,767 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:01:50,778 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:01:50,784 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 08:01:50,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:50 BoogieIcfgContainer [2023-11-19 08:01:50,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:01:50,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:01:50,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:01:50,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:01:50,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:01:49" (1/3) ... [2023-11-19 08:01:50,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ef30a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:50, skipping insertion in model container [2023-11-19 08:01:50,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (2/3) ... [2023-11-19 08:01:50,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ef30a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:50, skipping insertion in model container [2023-11-19 08:01:50,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:50" (3/3) ... [2023-11-19 08:01:50,804 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2023-11-19 08:01:50,814 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:01:50,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:01:50,826 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 08:01:50,827 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:01:50,934 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:01:50,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 155 transitions, 322 flow [2023-11-19 08:01:51,145 INFO L124 PetriNetUnfolderBase]: 12/152 cut-off events. [2023-11-19 08:01:51,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:51,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 152 events. 12/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 322 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-11-19 08:01:51,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 155 transitions, 322 flow [2023-11-19 08:01:51,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 152 transitions, 313 flow [2023-11-19 08:01:51,175 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:01:51,188 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 152 transitions, 313 flow [2023-11-19 08:01:51,191 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 152 transitions, 313 flow [2023-11-19 08:01:51,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 152 transitions, 313 flow [2023-11-19 08:01:51,231 INFO L124 PetriNetUnfolderBase]: 12/152 cut-off events. [2023-11-19 08:01:51,231 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:51,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 152 events. 12/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 321 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-11-19 08:01:51,241 INFO L119 LiptonReduction]: Number of co-enabled transitions 9322 [2023-11-19 08:01:56,368 INFO L134 LiptonReduction]: Checked pairs total: 19427 [2023-11-19 08:01:56,369 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-11-19 08:01:56,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:01:56,400 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;@5579d2a9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:01:56,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 08:01:56,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:01:56,410 INFO L124 PetriNetUnfolderBase]: 5/36 cut-off events. [2023-11-19 08:01:56,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:56,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:01:56,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:56,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:01:56,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1661247459, now seen corresponding path program 1 times [2023-11-19 08:01:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292660397] [2023-11-19 08:01:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,182 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-19 08:01:57,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:57,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292660397] [2023-11-19 08:01:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292660397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:57,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:01:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70477443] [2023-11-19 08:01:57,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:57,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:01:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:57,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:01:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:01:57,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 281 [2023-11-19 08:01:57,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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-19 08:01:57,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:01:57,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 281 [2023-11-19 08:01:57,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:00,302 INFO L124 PetriNetUnfolderBase]: 20656/27959 cut-off events. [2023-11-19 08:02:00,302 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-19 08:02:00,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55221 conditions, 27959 events. 20656/27959 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 151705 event pairs, 5884 based on Foata normal form. 384/22970 useless extension candidates. Maximal degree in co-relation 55210. Up to 16351 conditions per place. [2023-11-19 08:02:00,552 INFO L140 encePairwiseOnDemand]: 268/281 looper letters, 66 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2023-11-19 08:02:00,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 321 flow [2023-11-19 08:02:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-11-19 08:02:00,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5741399762752076 [2023-11-19 08:02:00,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-11-19 08:02:00,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-11-19 08:02:00,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:00,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-11-19 08:02:00,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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-19 08:02:00,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-19 08:02:00,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-19 08:02:00,602 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 103 flow. Second operand 3 states and 484 transitions. [2023-11-19 08:02:00,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 321 flow [2023-11-19 08:02:00,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:02:00,612 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 158 flow [2023-11-19 08:02:00,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2023-11-19 08:02:00,619 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-11-19 08:02:00,619 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 158 flow [2023-11-19 08:02:00,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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-19 08:02:00,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:00,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:00,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:02:00,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:02:00,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -58474824, now seen corresponding path program 1 times [2023-11-19 08:02:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874330673] [2023-11-19 08:02:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:00,922 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-19 08:02:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874330673] [2023-11-19 08:02:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874330673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:02:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426609322] [2023-11-19 08:02:00,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:00,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:00,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:00,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:00,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:02:00,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 281 [2023-11-19 08:02:00,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 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-19 08:02:00,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:00,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 281 [2023-11-19 08:02:00,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:06,699 INFO L124 PetriNetUnfolderBase]: 48963/67049 cut-off events. [2023-11-19 08:02:06,699 INFO L125 PetriNetUnfolderBase]: For 14700/15012 co-relation queries the response was YES. [2023-11-19 08:02:06,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149766 conditions, 67049 events. 48963/67049 cut-off events. For 14700/15012 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 391898 event pairs, 11295 based on Foata normal form. 2/55932 useless extension candidates. Maximal degree in co-relation 149754. Up to 25599 conditions per place. [2023-11-19 08:02:07,300 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 128 selfloop transitions, 8 changer transitions 0/144 dead transitions. [2023-11-19 08:02:07,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 144 transitions, 696 flow [2023-11-19 08:02:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:02:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:02:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 804 transitions. [2023-11-19 08:02:07,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5722419928825623 [2023-11-19 08:02:07,306 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 804 transitions. [2023-11-19 08:02:07,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 804 transitions. [2023-11-19 08:02:07,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:07,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 804 transitions. [2023-11-19 08:02:07,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 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-19 08:02:07,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 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-19 08:02:07,321 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 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-19 08:02:07,321 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 158 flow. Second operand 5 states and 804 transitions. [2023-11-19 08:02:07,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 144 transitions, 696 flow [2023-11-19 08:02:07,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 144 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:07,397 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 218 flow [2023-11-19 08:02:07,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2023-11-19 08:02:07,400 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-11-19 08:02:07,400 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 218 flow [2023-11-19 08:02:07,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 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-19 08:02:07,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:07,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:07,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:02:07,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:02:07,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1910375260, now seen corresponding path program 1 times [2023-11-19 08:02:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:07,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835378399] [2023-11-19 08:02:07,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:07,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:07,589 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-19 08:02:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:07,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835378399] [2023-11-19 08:02:07,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835378399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:07,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:07,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:07,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033984670] [2023-11-19 08:02:07,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:07,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:07,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:07,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:07,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:07,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-11-19 08:02:07,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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-19 08:02:07,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:07,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-11-19 08:02:07,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:16,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [Black: 156#true, 72#L19-5true, 2#L1190true, 14#L1161true, 73#L1173true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-19 08:02:16,119 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 08:02:16,119 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:16,119 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:16,119 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:16,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [Black: 156#true, 2#L1190true, 14#L1161true, 73#L1173true, 41#L1210true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-19 08:02:16,120 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 08:02:16,120 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:16,120 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:16,121 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:16,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [Black: 156#true, 60#L1205-4true, 2#L1190true, 14#L1161true, 73#L1173true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-19 08:02:16,382 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 08:02:16,382 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:16,382 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:16,382 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:16,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [Black: 156#true, 2#L1190true, 14#L1161true, 73#L1173true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 17#L1205-6true, processThread1of1ForFork2InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse]) [2023-11-19 08:02:16,616 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 08:02:16,616 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:16,616 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:16,617 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:16,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [Black: 156#true, 2#L1190true, 73#L1173true, 14#L1161true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 87#L1206-1true, processThread1of1ForFork2InUse, 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse]) [2023-11-19 08:02:16,775 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:16,775 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:16,775 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:16,775 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:16,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [Black: 156#true, 2#L1190true, 14#L1161true, 73#L1173true, 3#ULTIMATE.startEXITtrue, Black: 162#true, Black: 164#(= 5 ~B~0), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-19 08:02:16,776 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:16,776 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:16,776 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:16,777 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:17,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [Black: 156#true, 2#L1190true, 104#L1208true, 14#L1161true, 73#L1173true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-19 08:02:17,140 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 08:02:17,141 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:17,141 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:17,141 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:17,267 INFO L124 PetriNetUnfolderBase]: 78426/108805 cut-off events. [2023-11-19 08:02:17,267 INFO L125 PetriNetUnfolderBase]: For 48361/50792 co-relation queries the response was YES. [2023-11-19 08:02:17,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264223 conditions, 108805 events. 78426/108805 cut-off events. For 48361/50792 co-relation queries the response was YES. Maximal size of possible extension queue 2825. Compared 728195 event pairs, 18581 based on Foata normal form. 2304/98136 useless extension candidates. Maximal degree in co-relation 264207. Up to 64396 conditions per place. [2023-11-19 08:02:17,907 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 78 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2023-11-19 08:02:17,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 560 flow [2023-11-19 08:02:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2023-11-19 08:02:17,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5504151838671412 [2023-11-19 08:02:17,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2023-11-19 08:02:17,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2023-11-19 08:02:17,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:17,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2023-11-19 08:02:17,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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-19 08:02:17,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-19 08:02:17,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 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-19 08:02:17,916 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 218 flow. Second operand 3 states and 464 transitions. [2023-11-19 08:02:17,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 560 flow [2023-11-19 08:02:17,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 560 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:17,933 INFO L231 Difference]: Finished difference. Result has 58 places, 68 transitions, 307 flow [2023-11-19 08:02:17,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=58, PETRI_TRANSITIONS=68} [2023-11-19 08:02:17,935 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-11-19 08:02:17,935 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 68 transitions, 307 flow [2023-11-19 08:02:17,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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-19 08:02:17,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:17,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:17,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:02:17,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:02:17,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1317908023, now seen corresponding path program 1 times [2023-11-19 08:02:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017965074] [2023-11-19 08:02:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:18,160 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-19 08:02:18,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:18,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017965074] [2023-11-19 08:02:18,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017965074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:18,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:18,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:02:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409332691] [2023-11-19 08:02:18,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:18,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:18,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:02:18,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 281 [2023-11-19 08:02:18,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 68 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 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-19 08:02:18,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:18,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 281 [2023-11-19 08:02:18,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:29,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [72#L19-5true, Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,111 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:29,112 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,112 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,112 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [72#L19-5true, Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,113 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:29,113 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,113 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,113 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [72#L19-5true, Black: 158#(= ~B~0 ~A~0), 162#true, 14#L1161true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-19 08:02:29,150 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 08:02:29,150 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,150 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,150 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:29,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [72#L19-5true, Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, 14#L1161true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-19 08:02:29,151 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 08:02:29,151 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,151 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,151 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:29,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,207 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:29,208 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,208 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,208 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,208 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:29,208 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,208 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,208 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,209 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:29,209 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,209 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,209 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,209 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:29,210 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,210 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:29,210 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 162#true, 14#L1161true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,238 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-19 08:02:29,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,238 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:29,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 18#L1186-2true, 14#L1161true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,238 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-19 08:02:29,239 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:29,239 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,239 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, 14#L1161true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,239 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-19 08:02:29,239 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:29,240 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,240 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, 14#L1161true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,240 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-19 08:02:29,240 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:29,241 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,241 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:29,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 12#L1157-6true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,285 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-19 08:02:29,285 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,285 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,285 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, 12#L1157-6true, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-19 08:02:29,286 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-19 08:02:29,286 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,286 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,286 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 12#L1157-6true, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-19 08:02:29,287 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-19 08:02:29,288 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,288 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,288 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 12#L1157-6true, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-19 08:02:29,288 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-19 08:02:29,289 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,289 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,289 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,327 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:29,327 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,327 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,327 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:29,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,328 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:29,328 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,328 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,328 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:29,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, 91#generateEXITtrue, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,329 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:29,329 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,329 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:29,330 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, 91#generateEXITtrue, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-19 08:02:29,330 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:29,330 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,330 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:29,331 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 87#L1206-1true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,345 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:29,346 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,346 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:29,346 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:29,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 87#L1206-1true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,346 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:29,346 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:29,346 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,346 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:29,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, 104#L1208true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,366 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-19 08:02:29,366 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,366 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,366 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, 104#L1208true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,366 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-19 08:02:29,367 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,367 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,367 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:29,398 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-19 08:02:29,398 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:29,398 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,398 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:29,398 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,398 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:29,399 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-19 08:02:29,399 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:29,399 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:29,399 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,399 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,399 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:29,400 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,400 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:29,400 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,400 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:29,400 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:29,400 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,400 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-19 08:02:29,401 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:29,401 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,401 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:29,401 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:29,401 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:29,898 INFO L124 PetriNetUnfolderBase]: 93186/127246 cut-off events. [2023-11-19 08:02:29,898 INFO L125 PetriNetUnfolderBase]: For 125269/130834 co-relation queries the response was YES. [2023-11-19 08:02:30,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380154 conditions, 127246 events. 93186/127246 cut-off events. For 125269/130834 co-relation queries the response was YES. Maximal size of possible extension queue 3010. Compared 805794 event pairs, 21047 based on Foata normal form. 2594/123905 useless extension candidates. Maximal degree in co-relation 380136. Up to 56332 conditions per place. [2023-11-19 08:02:30,698 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 158 selfloop transitions, 19 changer transitions 0/185 dead transitions. [2023-11-19 08:02:30,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 185 transitions, 1153 flow [2023-11-19 08:02:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:02:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:02:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 803 transitions. [2023-11-19 08:02:30,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5715302491103202 [2023-11-19 08:02:30,703 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 803 transitions. [2023-11-19 08:02:30,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 803 transitions. [2023-11-19 08:02:30,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:30,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 803 transitions. [2023-11-19 08:02:30,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 0 states have call successors, (0), 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-19 08:02:30,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 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-19 08:02:30,714 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 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-19 08:02:30,714 INFO L175 Difference]: Start difference. First operand has 58 places, 68 transitions, 307 flow. Second operand 5 states and 803 transitions. [2023-11-19 08:02:30,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 185 transitions, 1153 flow [2023-11-19 08:02:30,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 185 transitions, 1108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:30,776 INFO L231 Difference]: Finished difference. Result has 64 places, 81 transitions, 445 flow [2023-11-19 08:02:30,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=64, PETRI_TRANSITIONS=81} [2023-11-19 08:02:30,777 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-11-19 08:02:30,777 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 81 transitions, 445 flow [2023-11-19 08:02:30,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 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-19 08:02:30,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:30,778 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-19 08:02:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:02:30,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:02:30,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash -803296804, now seen corresponding path program 1 times [2023-11-19 08:02:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477756050] [2023-11-19 08:02:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:31,112 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-19 08:02:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477756050] [2023-11-19 08:02:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477756050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:31,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:31,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802669223] [2023-11-19 08:02:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:31,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:31,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:31,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:02:31,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 281 [2023-11-19 08:02:31,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 81 transitions, 445 flow. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 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-19 08:02:31,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:31,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 281 [2023-11-19 08:02:31,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:32,788 INFO L124 PetriNetUnfolderBase]: 10261/15589 cut-off events. [2023-11-19 08:02:32,788 INFO L125 PetriNetUnfolderBase]: For 18631/19161 co-relation queries the response was YES. [2023-11-19 08:02:32,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43771 conditions, 15589 events. 10261/15589 cut-off events. For 18631/19161 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 91591 event pairs, 1836 based on Foata normal form. 1566/16984 useless extension candidates. Maximal degree in co-relation 43749. Up to 12402 conditions per place. [2023-11-19 08:02:32,875 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 59 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2023-11-19 08:02:32,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 540 flow [2023-11-19 08:02:32,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2023-11-19 08:02:32,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231316725978647 [2023-11-19 08:02:32,878 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2023-11-19 08:02:32,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2023-11-19 08:02:32,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:32,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2023-11-19 08:02:32,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 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-19 08:02:32,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 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-19 08:02:32,886 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 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-19 08:02:32,887 INFO L175 Difference]: Start difference. First operand has 64 places, 81 transitions, 445 flow. Second operand 4 states and 588 transitions. [2023-11-19 08:02:32,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 540 flow [2023-11-19 08:02:32,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 527 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:32,918 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 345 flow [2023-11-19 08:02:32,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-11-19 08:02:32,919 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-11-19 08:02:32,920 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 345 flow [2023-11-19 08:02:32,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 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-19 08:02:32,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:32,920 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-19 08:02:32,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:02:32,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:02:32,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1757191459, now seen corresponding path program 1 times [2023-11-19 08:02:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535846818] [2023-11-19 08:02:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:33,140 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-19 08:02:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:33,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535846818] [2023-11-19 08:02:33,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535846818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:33,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:33,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:02:33,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538799452] [2023-11-19 08:02:33,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:33,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:33,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:33,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 281 [2023-11-19 08:02:33,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 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-19 08:02:33,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:33,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 281 [2023-11-19 08:02:33,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:34,256 INFO L124 PetriNetUnfolderBase]: 7461/11449 cut-off events. [2023-11-19 08:02:34,256 INFO L125 PetriNetUnfolderBase]: For 11106/11195 co-relation queries the response was YES. [2023-11-19 08:02:34,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32253 conditions, 11449 events. 7461/11449 cut-off events. For 11106/11195 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 64632 event pairs, 1679 based on Foata normal form. 574/11974 useless extension candidates. Maximal degree in co-relation 32230. Up to 6596 conditions per place. [2023-11-19 08:02:34,317 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 62 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2023-11-19 08:02:34,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 609 flow [2023-11-19 08:02:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-11-19 08:02:34,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124555160142349 [2023-11-19 08:02:34,320 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-11-19 08:02:34,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-11-19 08:02:34,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:34,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-11-19 08:02:34,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 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-19 08:02:34,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 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-19 08:02:34,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 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-19 08:02:34,327 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 345 flow. Second operand 4 states and 576 transitions. [2023-11-19 08:02:34,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 609 flow [2023-11-19 08:02:34,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 586 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:34,348 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 363 flow [2023-11-19 08:02:34,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-11-19 08:02:34,350 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2023-11-19 08:02:34,350 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 363 flow [2023-11-19 08:02:34,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 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-19 08:02:34,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:34,351 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-19 08:02:34,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:02:34,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:02:34,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1093662389, now seen corresponding path program 1 times [2023-11-19 08:02:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13629153] [2023-11-19 08:02:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:34,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:34,674 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-19 08:02:34,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13629153] [2023-11-19 08:02:34,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13629153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:34,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:02:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668268434] [2023-11-19 08:02:34,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:34,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:02:34,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:34,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:02:34,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:02:34,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 281 [2023-11-19 08:02:34,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 0 states have call successors, (0), 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-19 08:02:34,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:34,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 281 [2023-11-19 08:02:34,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:37,884 INFO L124 PetriNetUnfolderBase]: 19309/28105 cut-off events. [2023-11-19 08:02:37,885 INFO L125 PetriNetUnfolderBase]: For 30818/30819 co-relation queries the response was YES. [2023-11-19 08:02:37,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81186 conditions, 28105 events. 19309/28105 cut-off events. For 30818/30819 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 151540 event pairs, 3830 based on Foata normal form. 1317/29367 useless extension candidates. Maximal degree in co-relation 81162. Up to 7164 conditions per place. [2023-11-19 08:02:38,020 INFO L140 encePairwiseOnDemand]: 264/281 looper letters, 357 selfloop transitions, 72 changer transitions 3/436 dead transitions. [2023-11-19 08:02:38,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 436 transitions, 2848 flow [2023-11-19 08:02:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-19 08:02:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-19 08:02:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3327 transitions. [2023-11-19 08:02:38,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147764196193718 [2023-11-19 08:02:38,034 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3327 transitions. [2023-11-19 08:02:38,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3327 transitions. [2023-11-19 08:02:38,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:38,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3327 transitions. [2023-11-19 08:02:38,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 144.65217391304347) internal successors, (3327), 23 states have internal predecessors, (3327), 0 states have call successors, (0), 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-19 08:02:38,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 281.0) internal successors, (6744), 24 states have internal predecessors, (6744), 0 states have call successors, (0), 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-19 08:02:38,063 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 281.0) internal successors, (6744), 24 states have internal predecessors, (6744), 0 states have call successors, (0), 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-19 08:02:38,063 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 363 flow. Second operand 23 states and 3327 transitions. [2023-11-19 08:02:38,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 436 transitions, 2848 flow [2023-11-19 08:02:38,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 436 transitions, 2754 flow, removed 0 selfloop flow, removed 2 redundant places.