./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:11:45,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:11:45,185 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 05:11:45,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:11:45,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:11:45,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:11:45,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:11:45,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:11:45,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:11:45,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:11:45,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:11:45,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:11:45,224 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:11:45,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:11:45,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:11:45,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:11:45,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:11:45,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:11:45,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:11:45,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:11:45,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:11:45,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:11:45,226 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 05:11:45,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:11:45,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:11:45,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:11:45,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:11:45,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:11:45,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:11:45,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:11:45,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:11:45,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:11:45,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:11:45,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:11:45,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:11:45,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:11:45,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:11:45,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:11:45,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:11:45,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:11:45,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:11:45,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:11:45,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:11:45,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:11:45,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:11:45,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:11:45,229 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB 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 ! data-race) ) 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2024-11-28 05:11:45,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:11:45,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:11:45,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:11:45,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:11:45,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:11:45,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2024-11-28 05:11:48,456 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/data/b84b23f07/102b795ec1fc42f0b4b165c974911b82/FLAG09b45e2cd [2024-11-28 05:11:48,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:11:48,784 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2024-11-28 05:11:48,801 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/data/b84b23f07/102b795ec1fc42f0b4b165c974911b82/FLAG09b45e2cd [2024-11-28 05:11:48,825 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/data/b84b23f07/102b795ec1fc42f0b4b165c974911b82 [2024-11-28 05:11:48,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:11:48,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:11:48,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:11:48,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:11:48,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:11:48,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:11:48" (1/1) ... [2024-11-28 05:11:48,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a79086f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:48, skipping insertion in model container [2024-11-28 05:11:48,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:11:48" (1/1) ... [2024-11-28 05:11:48,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:11:49,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:11:49,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:11:49,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:11:49,189 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:11:49,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49 WrapperNode [2024-11-28 05:11:49,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:11:49,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:11:49,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:11:49,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:11:49,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,253 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 537 [2024-11-28 05:11:49,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:11:49,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:11:49,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:11:49,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:11:49,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:11:49,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:11:49,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:11:49,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:11:49,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (1/1) ... [2024-11-28 05:11:49,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:11:49,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:11:49,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:11:49,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:11:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:11:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 05:11:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 05:11:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 05:11:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 05:11:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 05:11:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 05:11:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:11:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:11:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:11:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 05:11:49,382 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 05:11:49,556 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:11:49,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:11:50,798 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 05:11:50,799 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:11:50,848 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:11:50,848 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 05:11:50,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:11:50 BoogieIcfgContainer [2024-11-28 05:11:50,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:11:50,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:11:50,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:11:50,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:11:50,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:11:48" (1/3) ... [2024-11-28 05:11:50,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38645eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:11:50, skipping insertion in model container [2024-11-28 05:11:50,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:11:49" (2/3) ... [2024-11-28 05:11:50,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38645eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:11:50, skipping insertion in model container [2024-11-28 05:11:50,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:11:50" (3/3) ... [2024-11-28 05:11:50,866 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2024-11-28 05:11:50,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:11:50,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 685 locations, 1 initial locations, 4 loop locations, and 78 error locations. [2024-11-28 05:11:50,886 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 05:11:51,179 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 05:11:51,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 691 places, 717 transitions, 1448 flow [2024-11-28 05:11:51,745 INFO L124 PetriNetUnfolderBase]: 33/715 cut-off events. [2024-11-28 05:11:51,748 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 05:11:51,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 715 events. 33/715 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1121 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 521. Up to 2 conditions per place. [2024-11-28 05:11:51,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 691 places, 717 transitions, 1448 flow [2024-11-28 05:11:51,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 669 places, 693 transitions, 1398 flow [2024-11-28 05:11:51,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:11:51,830 INFO L333 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, 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;@4a8ed345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:11:51,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2024-11-28 05:11:51,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 05:11:51,843 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-11-28 05:11:51,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 05:11:51,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:51,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:51,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:51,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash -55491224, now seen corresponding path program 1 times [2024-11-28 05:11:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73630747] [2024-11-28 05:11:51,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73630747] [2024-11-28 05:11:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73630747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635491850] [2024-11-28 05:11:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:52,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:52,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:52,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:52,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 717 [2024-11-28 05:11:52,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 693 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:52,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:52,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 717 [2024-11-28 05:11:52,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:52,922 INFO L124 PetriNetUnfolderBase]: 39/1279 cut-off events. [2024-11-28 05:11:52,923 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-28 05:11:52,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1279 events. 39/1279 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5104 event pairs, 15 based on Foata normal form. 33/1089 useless extension candidates. Maximal degree in co-relation 949. Up to 48 conditions per place. [2024-11-28 05:11:52,941 INFO L140 encePairwiseOnDemand]: 695/717 looper letters, 17 selfloop transitions, 2 changer transitions 11/673 dead transitions. [2024-11-28 05:11:52,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 673 transitions, 1396 flow [2024-11-28 05:11:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2024-11-28 05:11:52,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9595536959553695 [2024-11-28 05:11:52,974 INFO L175 Difference]: Start difference. First operand has 669 places, 693 transitions, 1398 flow. Second operand 3 states and 2064 transitions. [2024-11-28 05:11:52,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 673 transitions, 1396 flow [2024-11-28 05:11:52,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 673 transitions, 1388 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 05:11:53,011 INFO L231 Difference]: Finished difference. Result has 666 places, 662 transitions, 1332 flow [2024-11-28 05:11:53,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1332, PETRI_PLACES=666, PETRI_TRANSITIONS=662} [2024-11-28 05:11:53,020 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -3 predicate places. [2024-11-28 05:11:53,021 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 662 transitions, 1332 flow [2024-11-28 05:11:53,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:53,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:53,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:53,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:11:53,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:53,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash 282607015, now seen corresponding path program 1 times [2024-11-28 05:11:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:53,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745645089] [2024-11-28 05:11:53,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:53,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745645089] [2024-11-28 05:11:53,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745645089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:53,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:53,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249377761] [2024-11-28 05:11:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:53,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:53,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:53,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:53,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:53,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 717 [2024-11-28 05:11:53,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 662 transitions, 1332 flow. Second operand has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:53,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:53,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 717 [2024-11-28 05:11:53,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:53,772 INFO L124 PetriNetUnfolderBase]: 97/2038 cut-off events. [2024-11-28 05:11:53,772 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2024-11-28 05:11:53,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 2038 events. 97/2038 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11655 event pairs, 48 based on Foata normal form. 0/1703 useless extension candidates. Maximal degree in co-relation 2141. Up to 125 conditions per place. [2024-11-28 05:11:53,791 INFO L140 encePairwiseOnDemand]: 706/717 looper letters, 24 selfloop transitions, 1 changer transitions 0/652 dead transitions. [2024-11-28 05:11:53,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 652 transitions, 1362 flow [2024-11-28 05:11:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2024-11-28 05:11:53,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9381682938168294 [2024-11-28 05:11:53,803 INFO L175 Difference]: Start difference. First operand has 666 places, 662 transitions, 1332 flow. Second operand 3 states and 2018 transitions. [2024-11-28 05:11:53,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 652 transitions, 1362 flow [2024-11-28 05:11:53,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 652 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:53,815 INFO L231 Difference]: Finished difference. Result has 645 places, 652 transitions, 1310 flow [2024-11-28 05:11:53,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=645, PETRI_TRANSITIONS=652} [2024-11-28 05:11:53,817 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -24 predicate places. [2024-11-28 05:11:53,817 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 652 transitions, 1310 flow [2024-11-28 05:11:53,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:53,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:53,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:53,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:11:53,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:53,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1424864930, now seen corresponding path program 1 times [2024-11-28 05:11:53,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:53,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193504986] [2024-11-28 05:11:53,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:53,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193504986] [2024-11-28 05:11:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193504986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:53,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:53,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651758501] [2024-11-28 05:11:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:53,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:53,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:53,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:53,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 675 out of 717 [2024-11-28 05:11:53,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 652 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:53,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:53,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 675 of 717 [2024-11-28 05:11:53,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:54,258 INFO L124 PetriNetUnfolderBase]: 39/1263 cut-off events. [2024-11-28 05:11:54,259 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-28 05:11:54,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1263 events. 39/1263 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4921 event pairs, 15 based on Foata normal form. 0/1067 useless extension candidates. Maximal degree in co-relation 1285. Up to 48 conditions per place. [2024-11-28 05:11:54,270 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 17 selfloop transitions, 2 changer transitions 0/651 dead transitions. [2024-11-28 05:11:54,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 651 transitions, 1346 flow [2024-11-28 05:11:54,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2045 transitions. [2024-11-28 05:11:54,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9507205950720595 [2024-11-28 05:11:54,277 INFO L175 Difference]: Start difference. First operand has 645 places, 652 transitions, 1310 flow. Second operand 3 states and 2045 transitions. [2024-11-28 05:11:54,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 651 transitions, 1346 flow [2024-11-28 05:11:54,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 651 transitions, 1345 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:11:54,288 INFO L231 Difference]: Finished difference. Result has 645 places, 651 transitions, 1311 flow [2024-11-28 05:11:54,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=645, PETRI_TRANSITIONS=651} [2024-11-28 05:11:54,291 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -24 predicate places. [2024-11-28 05:11:54,292 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 651 transitions, 1311 flow [2024-11-28 05:11:54,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:54,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:54,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:54,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:11:54,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:54,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash -565194398, now seen corresponding path program 1 times [2024-11-28 05:11:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:54,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881685759] [2024-11-28 05:11:54,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881685759] [2024-11-28 05:11:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881685759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:54,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509738365] [2024-11-28 05:11:54,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:54,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:54,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:54,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:54,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 717 [2024-11-28 05:11:54,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 651 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:54,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:54,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 717 [2024-11-28 05:11:54,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:54,877 INFO L124 PetriNetUnfolderBase]: 98/2027 cut-off events. [2024-11-28 05:11:54,878 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-28 05:11:54,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 2027 events. 98/2027 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11440 event pairs, 48 based on Foata normal form. 0/1726 useless extension candidates. Maximal degree in co-relation 2134. Up to 127 conditions per place. [2024-11-28 05:11:54,893 INFO L140 encePairwiseOnDemand]: 706/717 looper letters, 24 selfloop transitions, 1 changer transitions 0/641 dead transitions. [2024-11-28 05:11:54,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 641 transitions, 1341 flow [2024-11-28 05:11:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2024-11-28 05:11:54,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9381682938168294 [2024-11-28 05:11:54,899 INFO L175 Difference]: Start difference. First operand has 645 places, 651 transitions, 1311 flow. Second operand 3 states and 2018 transitions. [2024-11-28 05:11:54,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 641 transitions, 1341 flow [2024-11-28 05:11:54,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 641 transitions, 1337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:54,914 INFO L231 Difference]: Finished difference. Result has 635 places, 641 transitions, 1289 flow [2024-11-28 05:11:54,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=635, PETRI_TRANSITIONS=641} [2024-11-28 05:11:54,916 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-28 05:11:54,917 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 641 transitions, 1289 flow [2024-11-28 05:11:54,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:54,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:54,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:54,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:11:54,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash -375393352, now seen corresponding path program 1 times [2024-11-28 05:11:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:54,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552056631] [2024-11-28 05:11:54,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552056631] [2024-11-28 05:11:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552056631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:55,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:55,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414406572] [2024-11-28 05:11:55,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:55,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:55,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:55,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-28 05:11:55,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 641 transitions, 1289 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:55,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:55,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-28 05:11:55,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:55,191 INFO L124 PetriNetUnfolderBase]: 16/789 cut-off events. [2024-11-28 05:11:55,191 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-28 05:11:55,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 789 events. 16/789 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1380 event pairs, 1 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 775. Up to 13 conditions per place. [2024-11-28 05:11:55,201 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/640 dead transitions. [2024-11-28 05:11:55,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 640 transitions, 1311 flow [2024-11-28 05:11:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-28 05:11:55,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-28 05:11:55,206 INFO L175 Difference]: Start difference. First operand has 635 places, 641 transitions, 1289 flow. Second operand 3 states and 2059 transitions. [2024-11-28 05:11:55,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 640 transitions, 1311 flow [2024-11-28 05:11:55,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 640 transitions, 1310 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:11:55,217 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1290 flow [2024-11-28 05:11:55,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=635, PETRI_TRANSITIONS=640} [2024-11-28 05:11:55,219 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-28 05:11:55,219 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1290 flow [2024-11-28 05:11:55,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:55,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:55,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:55,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:11:55,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:55,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1093604891, now seen corresponding path program 1 times [2024-11-28 05:11:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:55,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840044848] [2024-11-28 05:11:55,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:55,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:55,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840044848] [2024-11-28 05:11:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840044848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:55,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:55,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:55,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911309579] [2024-11-28 05:11:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:55,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:55,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:55,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:55,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:55,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-28 05:11:55,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 640 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:55,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:55,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-28 05:11:55,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:55,528 INFO L124 PetriNetUnfolderBase]: 24/1086 cut-off events. [2024-11-28 05:11:55,528 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-28 05:11:55,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1086 events. 24/1086 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3372 event pairs, 3 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1080. Up to 17 conditions per place. [2024-11-28 05:11:55,536 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/639 dead transitions. [2024-11-28 05:11:55,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 639 transitions, 1312 flow [2024-11-28 05:11:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-28 05:11:55,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-28 05:11:55,541 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1290 flow. Second operand 3 states and 2059 transitions. [2024-11-28 05:11:55,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 639 transitions, 1312 flow [2024-11-28 05:11:55,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 639 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:55,550 INFO L231 Difference]: Finished difference. Result has 634 places, 639 transitions, 1288 flow [2024-11-28 05:11:55,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=634, PETRI_TRANSITIONS=639} [2024-11-28 05:11:55,552 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2024-11-28 05:11:55,552 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 639 transitions, 1288 flow [2024-11-28 05:11:55,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:55,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:55,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:55,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:11:55,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:55,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1262396217, now seen corresponding path program 1 times [2024-11-28 05:11:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:55,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224501025] [2024-11-28 05:11:55,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224501025] [2024-11-28 05:11:55,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224501025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581860956] [2024-11-28 05:11:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:55,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:55,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:55,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:55,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-28 05:11:55,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 639 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:55,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:55,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-28 05:11:55,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:55,877 INFO L124 PetriNetUnfolderBase]: 24/1085 cut-off events. [2024-11-28 05:11:55,877 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-28 05:11:55,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 1085 events. 24/1085 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3349 event pairs, 3 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1079. Up to 17 conditions per place. [2024-11-28 05:11:55,885 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/638 dead transitions. [2024-11-28 05:11:55,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 638 transitions, 1310 flow [2024-11-28 05:11:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-28 05:11:55,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-28 05:11:55,890 INFO L175 Difference]: Start difference. First operand has 634 places, 639 transitions, 1288 flow. Second operand 3 states and 2059 transitions. [2024-11-28 05:11:55,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 638 transitions, 1310 flow [2024-11-28 05:11:55,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 638 transitions, 1306 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:55,900 INFO L231 Difference]: Finished difference. Result has 633 places, 638 transitions, 1286 flow [2024-11-28 05:11:55,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1286, PETRI_PLACES=633, PETRI_TRANSITIONS=638} [2024-11-28 05:11:55,902 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -36 predicate places. [2024-11-28 05:11:55,902 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 638 transitions, 1286 flow [2024-11-28 05:11:55,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:55,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:55,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:55,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:11:55,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:55,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:55,905 INFO L85 PathProgramCache]: Analyzing trace with hash 589227558, now seen corresponding path program 1 times [2024-11-28 05:11:55,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:55,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270957323] [2024-11-28 05:11:55,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:55,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270957323] [2024-11-28 05:11:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270957323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:56,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180754697] [2024-11-28 05:11:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:56,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:56,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:56,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:56,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-28 05:11:56,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 638 transitions, 1286 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:56,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:56,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-28 05:11:56,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:56,187 INFO L124 PetriNetUnfolderBase]: 13/652 cut-off events. [2024-11-28 05:11:56,187 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 05:11:56,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 652 events. 13/652 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1032 event pairs, 1 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 639. Up to 13 conditions per place. [2024-11-28 05:11:56,193 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2024-11-28 05:11:56,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 637 transitions, 1308 flow [2024-11-28 05:11:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-28 05:11:56,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-28 05:11:56,199 INFO L175 Difference]: Start difference. First operand has 633 places, 638 transitions, 1286 flow. Second operand 3 states and 2059 transitions. [2024-11-28 05:11:56,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 637 transitions, 1308 flow [2024-11-28 05:11:56,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 637 transitions, 1304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:56,212 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1284 flow [2024-11-28 05:11:56,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2024-11-28 05:11:56,215 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -37 predicate places. [2024-11-28 05:11:56,215 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1284 flow [2024-11-28 05:11:56,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:56,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:56,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:56,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:11:56,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:56,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 392409961, now seen corresponding path program 1 times [2024-11-28 05:11:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99184075] [2024-11-28 05:11:56,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:56,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:56,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99184075] [2024-11-28 05:11:56,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99184075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:56,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:56,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137715588] [2024-11-28 05:11:56,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:56,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:56,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:56,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:56,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:56,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-28 05:11:56,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:56,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:56,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-28 05:11:56,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:56,537 INFO L124 PetriNetUnfolderBase]: 18/769 cut-off events. [2024-11-28 05:11:56,537 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-28 05:11:56,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 769 events. 18/769 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1449 event pairs, 3 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 760. Up to 17 conditions per place. [2024-11-28 05:11:56,543 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2024-11-28 05:11:56,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 636 transitions, 1306 flow [2024-11-28 05:11:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-28 05:11:56,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-28 05:11:56,548 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1284 flow. Second operand 3 states and 2059 transitions. [2024-11-28 05:11:56,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 636 transitions, 1306 flow [2024-11-28 05:11:56,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 636 transitions, 1302 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:56,558 INFO L231 Difference]: Finished difference. Result has 631 places, 636 transitions, 1282 flow [2024-11-28 05:11:56,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1282, PETRI_PLACES=631, PETRI_TRANSITIONS=636} [2024-11-28 05:11:56,560 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2024-11-28 05:11:56,560 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 636 transitions, 1282 flow [2024-11-28 05:11:56,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:56,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:56,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:56,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:11:56,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:56,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash 183800997, now seen corresponding path program 1 times [2024-11-28 05:11:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576731082] [2024-11-28 05:11:56,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:56,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:56,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:56,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576731082] [2024-11-28 05:11:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576731082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:56,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:56,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:56,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832891346] [2024-11-28 05:11:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:56,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:56,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:56,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:56,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 682 out of 717 [2024-11-28 05:11:56,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 636 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:56,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:56,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 682 of 717 [2024-11-28 05:11:56,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:56,798 INFO L124 PetriNetUnfolderBase]: 18/749 cut-off events. [2024-11-28 05:11:56,798 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-28 05:11:56,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 749 events. 18/749 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1403 event pairs, 3 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 740. Up to 17 conditions per place. [2024-11-28 05:11:56,804 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2024-11-28 05:11:56,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 635 transitions, 1304 flow [2024-11-28 05:11:56,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2059 transitions. [2024-11-28 05:11:56,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9572291957229195 [2024-11-28 05:11:56,809 INFO L175 Difference]: Start difference. First operand has 631 places, 636 transitions, 1282 flow. Second operand 3 states and 2059 transitions. [2024-11-28 05:11:56,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 635 transitions, 1304 flow [2024-11-28 05:11:56,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 635 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:56,819 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1280 flow [2024-11-28 05:11:56,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2024-11-28 05:11:56,821 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -39 predicate places. [2024-11-28 05:11:56,822 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1280 flow [2024-11-28 05:11:56,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 683.3333333333334) internal successors, (2050), 3 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:56,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:56,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:56,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:11:56,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1675029539, now seen corresponding path program 1 times [2024-11-28 05:11:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269004454] [2024-11-28 05:11:56,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:57,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:57,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269004454] [2024-11-28 05:11:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269004454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:57,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:11:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207117892] [2024-11-28 05:11:57,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:11:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:57,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:11:57,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:11:58,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 717 [2024-11-28 05:11:58,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1280 flow. Second operand has 6 states, 6 states have (on average 627.5) internal successors, (3765), 6 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:58,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:58,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 717 [2024-11-28 05:11:58,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:59,226 INFO L124 PetriNetUnfolderBase]: 439/4181 cut-off events. [2024-11-28 05:11:59,226 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-28 05:11:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5009 conditions, 4181 events. 439/4181 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32651 event pairs, 360 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 4974. Up to 792 conditions per place. [2024-11-28 05:11:59,250 INFO L140 encePairwiseOnDemand]: 705/717 looper letters, 58 selfloop transitions, 10 changer transitions 0/633 dead transitions. [2024-11-28 05:11:59,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 633 transitions, 1412 flow [2024-11-28 05:11:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:11:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:11:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3826 transitions. [2024-11-28 05:11:59,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8893537889353789 [2024-11-28 05:11:59,261 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1280 flow. Second operand 6 states and 3826 transitions. [2024-11-28 05:11:59,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 633 transitions, 1412 flow [2024-11-28 05:11:59,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 633 transitions, 1408 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:59,273 INFO L231 Difference]: Finished difference. Result has 631 places, 633 transitions, 1292 flow [2024-11-28 05:11:59,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1292, PETRI_PLACES=631, PETRI_TRANSITIONS=633} [2024-11-28 05:11:59,275 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2024-11-28 05:11:59,275 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 633 transitions, 1292 flow [2024-11-28 05:11:59,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 627.5) internal successors, (3765), 6 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:59,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:59,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:59,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:11:59,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:59,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1363747049, now seen corresponding path program 1 times [2024-11-28 05:11:59,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:59,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780937852] [2024-11-28 05:11:59,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:59,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:59,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780937852] [2024-11-28 05:11:59,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780937852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:59,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:59,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970300270] [2024-11-28 05:11:59,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:59,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:59,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:59,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:59,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 717 [2024-11-28 05:11:59,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 633 transitions, 1292 flow. Second operand has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:59,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:59,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 717 [2024-11-28 05:11:59,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:59,567 INFO L124 PetriNetUnfolderBase]: 29/1074 cut-off events. [2024-11-28 05:11:59,567 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 05:11:59,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1074 events. 29/1074 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3690 event pairs, 8 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1089. Up to 28 conditions per place. [2024-11-28 05:11:59,574 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 11 selfloop transitions, 2 changer transitions 0/632 dead transitions. [2024-11-28 05:11:59,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 632 transitions, 1316 flow [2024-11-28 05:11:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2024-11-28 05:11:59,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9562993956299396 [2024-11-28 05:11:59,579 INFO L175 Difference]: Start difference. First operand has 631 places, 633 transitions, 1292 flow. Second operand 3 states and 2057 transitions. [2024-11-28 05:11:59,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 632 transitions, 1316 flow [2024-11-28 05:11:59,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 632 transitions, 1296 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 05:11:59,588 INFO L231 Difference]: Finished difference. Result has 627 places, 632 transitions, 1274 flow [2024-11-28 05:11:59,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1274, PETRI_PLACES=627, PETRI_TRANSITIONS=632} [2024-11-28 05:11:59,590 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -42 predicate places. [2024-11-28 05:11:59,590 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 632 transitions, 1274 flow [2024-11-28 05:11:59,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:59,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:59,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:11:59,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:59,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash -322461947, now seen corresponding path program 1 times [2024-11-28 05:11:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333598399] [2024-11-28 05:11:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:59,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:59,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333598399] [2024-11-28 05:11:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333598399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:59,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:11:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89832550] [2024-11-28 05:11:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:59,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:59,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:59,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:59,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:59,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 681 out of 717 [2024-11-28 05:11:59,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 632 transitions, 1274 flow. Second operand has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:59,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:11:59,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 681 of 717 [2024-11-28 05:11:59,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:11:59,889 INFO L124 PetriNetUnfolderBase]: 29/1079 cut-off events. [2024-11-28 05:11:59,890 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-28 05:11:59,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 1079 events. 29/1079 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3377 event pairs, 8 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1083. Up to 28 conditions per place. [2024-11-28 05:11:59,900 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 11 selfloop transitions, 2 changer transitions 0/631 dead transitions. [2024-11-28 05:11:59,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 631 transitions, 1298 flow [2024-11-28 05:11:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:11:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2024-11-28 05:11:59,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9562993956299396 [2024-11-28 05:11:59,904 INFO L175 Difference]: Start difference. First operand has 627 places, 632 transitions, 1274 flow. Second operand 3 states and 2057 transitions. [2024-11-28 05:11:59,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 631 transitions, 1298 flow [2024-11-28 05:11:59,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 631 transitions, 1294 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:11:59,914 INFO L231 Difference]: Finished difference. Result has 626 places, 631 transitions, 1272 flow [2024-11-28 05:11:59,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=626, PETRI_TRANSITIONS=631} [2024-11-28 05:11:59,916 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -43 predicate places. [2024-11-28 05:11:59,916 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 631 transitions, 1272 flow [2024-11-28 05:11:59,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 682.3333333333334) internal successors, (2047), 3 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:59,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:11:59,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:11:59,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:11:59,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:11:59,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1499515770, now seen corresponding path program 1 times [2024-11-28 05:11:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:59,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953506087] [2024-11-28 05:11:59,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:00,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953506087] [2024-11-28 05:12:00,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953506087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:00,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:00,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985028425] [2024-11-28 05:12:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:00,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:00,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:00,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:00,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 717 [2024-11-28 05:12:00,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 631 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:00,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:00,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 717 [2024-11-28 05:12:00,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:01,174 INFO L124 PetriNetUnfolderBase]: 439/4177 cut-off events. [2024-11-28 05:12:01,174 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-28 05:12:01,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5005 conditions, 4177 events. 439/4177 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32732 event pairs, 360 based on Foata normal form. 0/3604 useless extension candidates. Maximal degree in co-relation 4970. Up to 798 conditions per place. [2024-11-28 05:12:01,197 INFO L140 encePairwiseOnDemand]: 711/717 looper letters, 64 selfloop transitions, 4 changer transitions 0/629 dead transitions. [2024-11-28 05:12:01,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 629 transitions, 1404 flow [2024-11-28 05:12:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1948 transitions. [2024-11-28 05:12:01,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.905625290562529 [2024-11-28 05:12:01,202 INFO L175 Difference]: Start difference. First operand has 626 places, 631 transitions, 1272 flow. Second operand 3 states and 1948 transitions. [2024-11-28 05:12:01,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 629 transitions, 1404 flow [2024-11-28 05:12:01,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 629 transitions, 1400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:01,211 INFO L231 Difference]: Finished difference. Result has 624 places, 629 transitions, 1272 flow [2024-11-28 05:12:01,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=624, PETRI_TRANSITIONS=629} [2024-11-28 05:12:01,213 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -45 predicate places. [2024-11-28 05:12:01,213 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 629 transitions, 1272 flow [2024-11-28 05:12:01,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:01,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:01,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:01,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:12:01,215 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:01,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:01,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1455412095, now seen corresponding path program 1 times [2024-11-28 05:12:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:01,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136009759] [2024-11-28 05:12:01,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:01,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136009759] [2024-11-28 05:12:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136009759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:01,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247122617] [2024-11-28 05:12:01,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:01,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:01,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:01,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:01,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 717 [2024-11-28 05:12:01,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 629 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:01,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:01,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 717 [2024-11-28 05:12:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:01,456 INFO L124 PetriNetUnfolderBase]: 18/780 cut-off events. [2024-11-28 05:12:01,456 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-28 05:12:01,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 780 events. 18/780 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1752 event pairs, 3 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 788. Up to 16 conditions per place. [2024-11-28 05:12:01,462 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 9 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2024-11-28 05:12:01,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 628 transitions, 1292 flow [2024-11-28 05:12:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2061 transitions. [2024-11-28 05:12:01,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581589958158996 [2024-11-28 05:12:01,466 INFO L175 Difference]: Start difference. First operand has 624 places, 629 transitions, 1272 flow. Second operand 3 states and 2061 transitions. [2024-11-28 05:12:01,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 628 transitions, 1292 flow [2024-11-28 05:12:01,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 628 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:01,475 INFO L231 Difference]: Finished difference. Result has 623 places, 628 transitions, 1266 flow [2024-11-28 05:12:01,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=623, PETRI_TRANSITIONS=628} [2024-11-28 05:12:01,477 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -46 predicate places. [2024-11-28 05:12:01,477 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 628 transitions, 1266 flow [2024-11-28 05:12:01,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:01,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:01,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:01,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:12:01,479 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:01,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash 393397353, now seen corresponding path program 1 times [2024-11-28 05:12:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867996324] [2024-11-28 05:12:01,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:01,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867996324] [2024-11-28 05:12:01,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867996324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:01,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:01,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479392377] [2024-11-28 05:12:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:01,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:01,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:01,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:01,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 683 out of 717 [2024-11-28 05:12:01,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 628 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:01,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:01,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 683 of 717 [2024-11-28 05:12:01,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:01,739 INFO L124 PetriNetUnfolderBase]: 21/884 cut-off events. [2024-11-28 05:12:01,740 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 05:12:01,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 884 events. 21/884 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2031 event pairs, 3 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 875. Up to 16 conditions per place. [2024-11-28 05:12:01,746 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 9 selfloop transitions, 2 changer transitions 0/627 dead transitions. [2024-11-28 05:12:01,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 627 transitions, 1286 flow [2024-11-28 05:12:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2061 transitions. [2024-11-28 05:12:01,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581589958158996 [2024-11-28 05:12:01,753 INFO L175 Difference]: Start difference. First operand has 623 places, 628 transitions, 1266 flow. Second operand 3 states and 2061 transitions. [2024-11-28 05:12:01,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 627 transitions, 1286 flow [2024-11-28 05:12:01,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 627 transitions, 1282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:01,762 INFO L231 Difference]: Finished difference. Result has 622 places, 627 transitions, 1264 flow [2024-11-28 05:12:01,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=622, PETRI_TRANSITIONS=627} [2024-11-28 05:12:01,763 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -47 predicate places. [2024-11-28 05:12:01,763 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 627 transitions, 1264 flow [2024-11-28 05:12:01,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 684.3333333333334) internal successors, (2053), 3 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:01,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:01,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:12:01,766 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -595618075, now seen corresponding path program 1 times [2024-11-28 05:12:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558463876] [2024-11-28 05:12:01,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:01,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:01,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558463876] [2024-11-28 05:12:01,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558463876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:01,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:01,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:01,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926175224] [2024-11-28 05:12:01,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:01,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:01,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:01,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:01,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 717 [2024-11-28 05:12:01,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 627 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 680.3333333333334) internal successors, (2041), 3 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:01,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:01,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 717 [2024-11-28 05:12:01,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:02,154 INFO L124 PetriNetUnfolderBase]: 57/1622 cut-off events. [2024-11-28 05:12:02,154 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-28 05:12:02,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 1622 events. 57/1622 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7651 event pairs, 19 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1664. Up to 61 conditions per place. [2024-11-28 05:12:02,163 INFO L140 encePairwiseOnDemand]: 711/717 looper letters, 14 selfloop transitions, 2 changer transitions 0/626 dead transitions. [2024-11-28 05:12:02,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1295 flow [2024-11-28 05:12:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2024-11-28 05:12:02,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9562993956299396 [2024-11-28 05:12:02,167 INFO L175 Difference]: Start difference. First operand has 622 places, 627 transitions, 1264 flow. Second operand 3 states and 2057 transitions. [2024-11-28 05:12:02,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1295 flow [2024-11-28 05:12:02,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 626 transitions, 1291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:02,178 INFO L231 Difference]: Finished difference. Result has 619 places, 625 transitions, 1266 flow [2024-11-28 05:12:02,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=619, PETRI_TRANSITIONS=625} [2024-11-28 05:12:02,179 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -50 predicate places. [2024-11-28 05:12:02,180 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 625 transitions, 1266 flow [2024-11-28 05:12:02,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.3333333333334) internal successors, (2041), 3 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:02,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:02,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:02,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:12:02,181 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:02,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1948948698, now seen corresponding path program 1 times [2024-11-28 05:12:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128218643] [2024-11-28 05:12:02,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128218643] [2024-11-28 05:12:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128218643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667161548] [2024-11-28 05:12:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:02,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:02,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:02,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:02,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 679 out of 717 [2024-11-28 05:12:02,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 625 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 680.6666666666666) internal successors, (2042), 3 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:02,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:02,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 679 of 717 [2024-11-28 05:12:02,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:02,625 INFO L124 PetriNetUnfolderBase]: 57/1633 cut-off events. [2024-11-28 05:12:02,625 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2024-11-28 05:12:02,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 1633 events. 57/1633 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7895 event pairs, 15 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1681. Up to 62 conditions per place. [2024-11-28 05:12:02,635 INFO L140 encePairwiseOnDemand]: 711/717 looper letters, 14 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2024-11-28 05:12:02,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 624 transitions, 1297 flow [2024-11-28 05:12:02,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2024-11-28 05:12:02,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9562993956299396 [2024-11-28 05:12:02,639 INFO L175 Difference]: Start difference. First operand has 619 places, 625 transitions, 1266 flow. Second operand 3 states and 2057 transitions. [2024-11-28 05:12:02,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 624 transitions, 1297 flow [2024-11-28 05:12:02,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 624 transitions, 1297 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:12:02,651 INFO L231 Difference]: Finished difference. Result has 618 places, 623 transitions, 1272 flow [2024-11-28 05:12:02,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=618, PETRI_TRANSITIONS=623} [2024-11-28 05:12:02,653 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -51 predicate places. [2024-11-28 05:12:02,653 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 623 transitions, 1272 flow [2024-11-28 05:12:02,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 680.6666666666666) internal successors, (2042), 3 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:02,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:02,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:02,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:12:02,654 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:02,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1923149301, now seen corresponding path program 1 times [2024-11-28 05:12:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986268652] [2024-11-28 05:12:02,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986268652] [2024-11-28 05:12:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986268652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:02,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:02,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:12:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400294456] [2024-11-28 05:12:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:02,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:12:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:02,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:12:02,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:12:03,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 717 [2024-11-28 05:12:03,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 623 transitions, 1272 flow. Second operand has 7 states, 7 states have (on average 668.2857142857143) internal successors, (4678), 7 states have internal predecessors, (4678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:03,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:03,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 717 [2024-11-28 05:12:03,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:03,911 INFO L124 PetriNetUnfolderBase]: 38/1636 cut-off events. [2024-11-28 05:12:03,912 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-28 05:12:03,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 1636 events. 38/1636 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7770 event pairs, 0 based on Foata normal form. 1/1472 useless extension candidates. Maximal degree in co-relation 1687. Up to 29 conditions per place. [2024-11-28 05:12:03,924 INFO L140 encePairwiseOnDemand]: 707/717 looper letters, 45 selfloop transitions, 9 changer transitions 0/647 dead transitions. [2024-11-28 05:12:03,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 647 transitions, 1432 flow [2024-11-28 05:12:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:12:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:12:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4710 transitions. [2024-11-28 05:12:03,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384339509862523 [2024-11-28 05:12:03,934 INFO L175 Difference]: Start difference. First operand has 618 places, 623 transitions, 1272 flow. Second operand 7 states and 4710 transitions. [2024-11-28 05:12:03,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 647 transitions, 1432 flow [2024-11-28 05:12:03,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 647 transitions, 1432 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:12:03,944 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1329 flow [2024-11-28 05:12:03,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1329, PETRI_PLACES=628, PETRI_TRANSITIONS=629} [2024-11-28 05:12:03,946 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -41 predicate places. [2024-11-28 05:12:03,946 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1329 flow [2024-11-28 05:12:03,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 668.2857142857143) internal successors, (4678), 7 states have internal predecessors, (4678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:03,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:03,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:03,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:12:03,948 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:03,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1286831790, now seen corresponding path program 1 times [2024-11-28 05:12:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288293371] [2024-11-28 05:12:03,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:04,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288293371] [2024-11-28 05:12:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288293371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:04,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:12:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877617397] [2024-11-28 05:12:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:04,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:12:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:04,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:12:04,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:12:05,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 717 [2024-11-28 05:12:05,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 629 transitions, 1329 flow. Second operand has 6 states, 6 states have (on average 655.6666666666666) internal successors, (3934), 6 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:05,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:05,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 717 [2024-11-28 05:12:05,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:06,823 INFO L124 PetriNetUnfolderBase]: 350/4930 cut-off events. [2024-11-28 05:12:06,823 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-28 05:12:06,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 4930 events. 350/4930 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 40329 event pairs, 140 based on Foata normal form. 0/4372 useless extension candidates. Maximal degree in co-relation 5582. Up to 508 conditions per place. [2024-11-28 05:12:06,854 INFO L140 encePairwiseOnDemand]: 705/717 looper letters, 54 selfloop transitions, 8 changer transitions 0/649 dead transitions. [2024-11-28 05:12:06,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 649 transitions, 1497 flow [2024-11-28 05:12:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:12:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:12:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3990 transitions. [2024-11-28 05:12:06,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9274755927475593 [2024-11-28 05:12:06,863 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1329 flow. Second operand 6 states and 3990 transitions. [2024-11-28 05:12:06,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 649 transitions, 1497 flow [2024-11-28 05:12:06,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 649 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:06,875 INFO L231 Difference]: Finished difference. Result has 631 places, 633 transitions, 1378 flow [2024-11-28 05:12:06,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1378, PETRI_PLACES=631, PETRI_TRANSITIONS=633} [2024-11-28 05:12:06,876 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -38 predicate places. [2024-11-28 05:12:06,877 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 633 transitions, 1378 flow [2024-11-28 05:12:06,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 655.6666666666666) internal successors, (3934), 6 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:06,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:06,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:06,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 05:12:06,879 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:06,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1319110933, now seen corresponding path program 1 times [2024-11-28 05:12:06,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:06,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691771762] [2024-11-28 05:12:06,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:06,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691771762] [2024-11-28 05:12:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691771762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:06,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549781086] [2024-11-28 05:12:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:06,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:06,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:06,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:07,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:07,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 633 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:07,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:07,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:07,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:07,522 INFO L124 PetriNetUnfolderBase]: 94/3082 cut-off events. [2024-11-28 05:12:07,523 INFO L125 PetriNetUnfolderBase]: For 21/39 co-relation queries the response was YES. [2024-11-28 05:12:07,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 3082 events. 94/3082 cut-off events. For 21/39 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 23050 event pairs, 8 based on Foata normal form. 2/2734 useless extension candidates. Maximal degree in co-relation 3271. Up to 40 conditions per place. [2024-11-28 05:12:07,542 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2024-11-28 05:12:07,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 633 transitions, 1403 flow [2024-11-28 05:12:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-28 05:12:07,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-28 05:12:07,545 INFO L175 Difference]: Start difference. First operand has 631 places, 633 transitions, 1378 flow. Second operand 3 states and 2065 transitions. [2024-11-28 05:12:07,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 633 transitions, 1403 flow [2024-11-28 05:12:07,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 633 transitions, 1403 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:12:07,557 INFO L231 Difference]: Finished difference. Result has 632 places, 632 transitions, 1380 flow [2024-11-28 05:12:07,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1380, PETRI_PLACES=632, PETRI_TRANSITIONS=632} [2024-11-28 05:12:07,560 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -37 predicate places. [2024-11-28 05:12:07,560 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 632 transitions, 1380 flow [2024-11-28 05:12:07,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:07,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:07,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:07,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 05:12:07,561 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:07,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:07,562 INFO L85 PathProgramCache]: Analyzing trace with hash -190412409, now seen corresponding path program 1 times [2024-11-28 05:12:07,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:07,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301076047] [2024-11-28 05:12:07,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:07,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301076047] [2024-11-28 05:12:08,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301076047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:08,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:08,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:12:08,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986841362] [2024-11-28 05:12:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:08,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:12:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:08,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:12:08,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:12:09,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 717 [2024-11-28 05:12:09,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 632 transitions, 1380 flow. Second operand has 6 states, 6 states have (on average 655.8333333333334) internal successors, (3935), 6 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:09,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:09,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 717 [2024-11-28 05:12:09,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:09,986 INFO L124 PetriNetUnfolderBase]: 368/5642 cut-off events. [2024-11-28 05:12:09,987 INFO L125 PetriNetUnfolderBase]: For 51/77 co-relation queries the response was YES. [2024-11-28 05:12:10,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6468 conditions, 5642 events. 368/5642 cut-off events. For 51/77 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 49324 event pairs, 132 based on Foata normal form. 0/5054 useless extension candidates. Maximal degree in co-relation 6421. Up to 540 conditions per place. [2024-11-28 05:12:10,015 INFO L140 encePairwiseOnDemand]: 705/717 looper letters, 54 selfloop transitions, 8 changer transitions 0/652 dead transitions. [2024-11-28 05:12:10,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 652 transitions, 1548 flow [2024-11-28 05:12:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:12:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:12:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3990 transitions. [2024-11-28 05:12:10,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9274755927475593 [2024-11-28 05:12:10,022 INFO L175 Difference]: Start difference. First operand has 632 places, 632 transitions, 1380 flow. Second operand 6 states and 3990 transitions. [2024-11-28 05:12:10,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 652 transitions, 1548 flow [2024-11-28 05:12:10,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 652 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:10,034 INFO L231 Difference]: Finished difference. Result has 635 places, 636 transitions, 1430 flow [2024-11-28 05:12:10,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1430, PETRI_PLACES=635, PETRI_TRANSITIONS=636} [2024-11-28 05:12:10,035 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-28 05:12:10,036 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 636 transitions, 1430 flow [2024-11-28 05:12:10,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 655.8333333333334) internal successors, (3935), 6 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:10,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:10,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:10,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 05:12:10,037 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:10,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash -957821686, now seen corresponding path program 1 times [2024-11-28 05:12:10,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:10,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077021999] [2024-11-28 05:12:10,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:10,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:10,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077021999] [2024-11-28 05:12:10,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077021999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:10,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:10,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:10,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752286890] [2024-11-28 05:12:10,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:10,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:10,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:10,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:10,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:10,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:10,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 636 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:10,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:10,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:10,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:10,887 INFO L124 PetriNetUnfolderBase]: 120/3688 cut-off events. [2024-11-28 05:12:10,887 INFO L125 PetriNetUnfolderBase]: For 51/65 co-relation queries the response was YES. [2024-11-28 05:12:10,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 3688 events. 120/3688 cut-off events. For 51/65 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 29012 event pairs, 8 based on Foata normal form. 0/3274 useless extension candidates. Maximal degree in co-relation 3969. Up to 64 conditions per place. [2024-11-28 05:12:10,914 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2024-11-28 05:12:10,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 636 transitions, 1455 flow [2024-11-28 05:12:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-28 05:12:10,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-28 05:12:10,918 INFO L175 Difference]: Start difference. First operand has 635 places, 636 transitions, 1430 flow. Second operand 3 states and 2065 transitions. [2024-11-28 05:12:10,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 636 transitions, 1455 flow [2024-11-28 05:12:10,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 636 transitions, 1455 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:12:10,928 INFO L231 Difference]: Finished difference. Result has 636 places, 635 transitions, 1432 flow [2024-11-28 05:12:10,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=636, PETRI_TRANSITIONS=635} [2024-11-28 05:12:10,929 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -33 predicate places. [2024-11-28 05:12:10,929 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 635 transitions, 1432 flow [2024-11-28 05:12:10,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:10,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:10,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:10,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:12:10,931 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:10,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:10,932 INFO L85 PathProgramCache]: Analyzing trace with hash 976030081, now seen corresponding path program 1 times [2024-11-28 05:12:10,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:10,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425230937] [2024-11-28 05:12:10,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:10,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:11,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425230937] [2024-11-28 05:12:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425230937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:11,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:11,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490844851] [2024-11-28 05:12:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:11,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:11,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:11,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:11,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:11,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:11,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 635 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:11,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:11,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:11,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:11,675 INFO L124 PetriNetUnfolderBase]: 122/3650 cut-off events. [2024-11-28 05:12:11,675 INFO L125 PetriNetUnfolderBase]: For 37/49 co-relation queries the response was YES. [2024-11-28 05:12:11,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4028 conditions, 3650 events. 122/3650 cut-off events. For 37/49 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 30244 event pairs, 8 based on Foata normal form. 0/3258 useless extension candidates. Maximal degree in co-relation 3979. Up to 84 conditions per place. [2024-11-28 05:12:11,691 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2024-11-28 05:12:11,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 635 transitions, 1457 flow [2024-11-28 05:12:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-28 05:12:11,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-28 05:12:11,695 INFO L175 Difference]: Start difference. First operand has 636 places, 635 transitions, 1432 flow. Second operand 3 states and 2065 transitions. [2024-11-28 05:12:11,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 635 transitions, 1457 flow [2024-11-28 05:12:11,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 635 transitions, 1453 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:11,706 INFO L231 Difference]: Finished difference. Result has 635 places, 634 transitions, 1430 flow [2024-11-28 05:12:11,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=635, PETRI_TRANSITIONS=634} [2024-11-28 05:12:11,707 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-28 05:12:11,707 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 634 transitions, 1430 flow [2024-11-28 05:12:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:11,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:11,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:11,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 05:12:11,708 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:11,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -459366396, now seen corresponding path program 1 times [2024-11-28 05:12:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134755004] [2024-11-28 05:12:11,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134755004] [2024-11-28 05:12:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134755004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060967451] [2024-11-28 05:12:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:11,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:11,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:11,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:11,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 717 [2024-11-28 05:12:11,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 634 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:11,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:11,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 717 [2024-11-28 05:12:11,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:13,081 INFO L124 PetriNetUnfolderBase]: 156/5304 cut-off events. [2024-11-28 05:12:13,081 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2024-11-28 05:12:13,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 5304 events. 156/5304 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 48775 event pairs, 8 based on Foata normal form. 0/4740 useless extension candidates. Maximal degree in co-relation 5630. Up to 96 conditions per place. [2024-11-28 05:12:13,103 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2024-11-28 05:12:13,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 635 transitions, 1457 flow [2024-11-28 05:12:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2069 transitions. [2024-11-28 05:12:13,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9618781961878197 [2024-11-28 05:12:13,107 INFO L175 Difference]: Start difference. First operand has 635 places, 634 transitions, 1430 flow. Second operand 3 states and 2069 transitions. [2024-11-28 05:12:13,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 635 transitions, 1457 flow [2024-11-28 05:12:13,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 635 transitions, 1453 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:13,117 INFO L231 Difference]: Finished difference. Result has 634 places, 634 transitions, 1436 flow [2024-11-28 05:12:13,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=634, PETRI_TRANSITIONS=634} [2024-11-28 05:12:13,119 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2024-11-28 05:12:13,119 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 634 transitions, 1436 flow [2024-11-28 05:12:13,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:13,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:13,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 05:12:13,120 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1159070602, now seen corresponding path program 1 times [2024-11-28 05:12:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371506989] [2024-11-28 05:12:13,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371506989] [2024-11-28 05:12:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371506989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:13,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652597369] [2024-11-28 05:12:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:13,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:13,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:13,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:13,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:13,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 634 transitions, 1436 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:13,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:13,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:13,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:14,174 INFO L124 PetriNetUnfolderBase]: 142/4748 cut-off events. [2024-11-28 05:12:14,174 INFO L125 PetriNetUnfolderBase]: For 55/69 co-relation queries the response was YES. [2024-11-28 05:12:14,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5194 conditions, 4748 events. 142/4748 cut-off events. For 55/69 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 42474 event pairs, 8 based on Foata normal form. 0/4258 useless extension candidates. Maximal degree in co-relation 5145. Up to 116 conditions per place. [2024-11-28 05:12:14,193 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2024-11-28 05:12:14,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 634 transitions, 1461 flow [2024-11-28 05:12:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-28 05:12:14,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-28 05:12:14,197 INFO L175 Difference]: Start difference. First operand has 634 places, 634 transitions, 1436 flow. Second operand 3 states and 2065 transitions. [2024-11-28 05:12:14,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 634 transitions, 1461 flow [2024-11-28 05:12:14,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 634 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:12:14,203 INFO L231 Difference]: Finished difference. Result has 635 places, 633 transitions, 1438 flow [2024-11-28 05:12:14,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=635, PETRI_TRANSITIONS=633} [2024-11-28 05:12:14,204 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-28 05:12:14,204 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 633 transitions, 1438 flow [2024-11-28 05:12:14,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:14,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:14,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:14,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 05:12:14,205 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:14,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1171934928, now seen corresponding path program 1 times [2024-11-28 05:12:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:14,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869242707] [2024-11-28 05:12:14,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869242707] [2024-11-28 05:12:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869242707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:14,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:14,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:14,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68271829] [2024-11-28 05:12:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:14,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:14,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:14,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:14,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 717 [2024-11-28 05:12:14,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 633 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:14,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:14,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 717 [2024-11-28 05:12:14,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:15,529 INFO L124 PetriNetUnfolderBase]: 162/5386 cut-off events. [2024-11-28 05:12:15,529 INFO L125 PetriNetUnfolderBase]: For 43/55 co-relation queries the response was YES. [2024-11-28 05:12:15,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 5386 events. 162/5386 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 49044 event pairs, 8 based on Foata normal form. 0/4848 useless extension candidates. Maximal degree in co-relation 5792. Up to 100 conditions per place. [2024-11-28 05:12:15,551 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 23 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2024-11-28 05:12:15,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 634 transitions, 1491 flow [2024-11-28 05:12:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2043 transitions. [2024-11-28 05:12:15,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497907949790795 [2024-11-28 05:12:15,556 INFO L175 Difference]: Start difference. First operand has 635 places, 633 transitions, 1438 flow. Second operand 3 states and 2043 transitions. [2024-11-28 05:12:15,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 634 transitions, 1491 flow [2024-11-28 05:12:15,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 634 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:15,566 INFO L231 Difference]: Finished difference. Result has 634 places, 633 transitions, 1444 flow [2024-11-28 05:12:15,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=634, PETRI_TRANSITIONS=633} [2024-11-28 05:12:15,567 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2024-11-28 05:12:15,568 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 633 transitions, 1444 flow [2024-11-28 05:12:15,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.3333333333334) internal successors, (2023), 3 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:15,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:15,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:15,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:12:15,569 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:15,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash 123137721, now seen corresponding path program 1 times [2024-11-28 05:12:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:15,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699558692] [2024-11-28 05:12:15,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:15,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:15,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699558692] [2024-11-28 05:12:15,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699558692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:15,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:15,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:15,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528596992] [2024-11-28 05:12:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:15,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:15,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:15,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:15,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 717 [2024-11-28 05:12:15,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 633 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:15,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:15,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 717 [2024-11-28 05:12:15,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:16,761 INFO L124 PetriNetUnfolderBase]: 184/6558 cut-off events. [2024-11-28 05:12:16,761 INFO L125 PetriNetUnfolderBase]: For 59/73 co-relation queries the response was YES. [2024-11-28 05:12:16,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7042 conditions, 6558 events. 184/6558 cut-off events. For 59/73 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 65757 event pairs, 4 based on Foata normal form. 0/5918 useless extension candidates. Maximal degree in co-relation 6992. Up to 100 conditions per place. [2024-11-28 05:12:16,794 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 11 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2024-11-28 05:12:16,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 635 transitions, 1476 flow [2024-11-28 05:12:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2024-11-28 05:12:16,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9623430962343096 [2024-11-28 05:12:16,798 INFO L175 Difference]: Start difference. First operand has 634 places, 633 transitions, 1444 flow. Second operand 3 states and 2070 transitions. [2024-11-28 05:12:16,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 635 transitions, 1476 flow [2024-11-28 05:12:16,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 635 transitions, 1476 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:12:16,804 INFO L231 Difference]: Finished difference. Result has 635 places, 633 transitions, 1454 flow [2024-11-28 05:12:16,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=635, PETRI_TRANSITIONS=633} [2024-11-28 05:12:16,805 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -34 predicate places. [2024-11-28 05:12:16,805 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 633 transitions, 1454 flow [2024-11-28 05:12:16,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:16,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:16,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:16,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 05:12:16,807 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:16,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1898156530, now seen corresponding path program 1 times [2024-11-28 05:12:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322740130] [2024-11-28 05:12:16,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322740130] [2024-11-28 05:12:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322740130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:12:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295074395] [2024-11-28 05:12:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:16,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:16,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:16,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:16,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 717 [2024-11-28 05:12:16,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 633 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:16,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:16,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 717 [2024-11-28 05:12:16,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:18,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][619], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 814#true, Black: 756#(<= 2147483647 ~id_0~0), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:18,080 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is not cut-off event [2024-11-28 05:12:18,080 INFO L297 olderBase$Statistics]: existing Event has 412 ancestors and is not cut-off event [2024-11-28 05:12:18,080 INFO L297 olderBase$Statistics]: existing Event has 440 ancestors and is not cut-off event [2024-11-28 05:12:18,080 INFO L297 olderBase$Statistics]: existing Event has 432 ancestors and is not cut-off event [2024-11-28 05:12:18,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][619], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 814#true, Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:18,089 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is not cut-off event [2024-11-28 05:12:18,089 INFO L297 olderBase$Statistics]: existing Event has 444 ancestors and is not cut-off event [2024-11-28 05:12:18,089 INFO L297 olderBase$Statistics]: existing Event has 452 ancestors and is not cut-off event [2024-11-28 05:12:18,089 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is not cut-off event [2024-11-28 05:12:18,093 INFO L124 PetriNetUnfolderBase]: 150/6044 cut-off events. [2024-11-28 05:12:18,093 INFO L125 PetriNetUnfolderBase]: For 53/85 co-relation queries the response was YES. [2024-11-28 05:12:18,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 6044 events. 150/6044 cut-off events. For 53/85 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 59717 event pairs, 12 based on Foata normal form. 2/5520 useless extension candidates. Maximal degree in co-relation 6630. Up to 157 conditions per place. [2024-11-28 05:12:18,133 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 11 selfloop transitions, 3 changer transitions 0/636 dead transitions. [2024-11-28 05:12:18,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 636 transitions, 1489 flow [2024-11-28 05:12:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2024-11-28 05:12:18,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9623430962343096 [2024-11-28 05:12:18,136 INFO L175 Difference]: Start difference. First operand has 635 places, 633 transitions, 1454 flow. Second operand 3 states and 2070 transitions. [2024-11-28 05:12:18,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 636 transitions, 1489 flow [2024-11-28 05:12:18,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 636 transitions, 1489 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:12:18,145 INFO L231 Difference]: Finished difference. Result has 639 places, 635 transitions, 1476 flow [2024-11-28 05:12:18,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=639, PETRI_TRANSITIONS=635} [2024-11-28 05:12:18,146 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -30 predicate places. [2024-11-28 05:12:18,146 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 635 transitions, 1476 flow [2024-11-28 05:12:18,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:18,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:18,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:18,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 05:12:18,149 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:18,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:18,150 INFO L85 PathProgramCache]: Analyzing trace with hash -503368204, now seen corresponding path program 1 times [2024-11-28 05:12:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:18,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567876298] [2024-11-28 05:12:18,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:18,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:18,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567876298] [2024-11-28 05:12:18,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567876298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:18,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:18,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884098633] [2024-11-28 05:12:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:18,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:18,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:18,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 717 [2024-11-28 05:12:18,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 635 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 674.6666666666666) internal successors, (2024), 3 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:18,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:18,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 717 [2024-11-28 05:12:18,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:19,937 INFO L124 PetriNetUnfolderBase]: 160/6416 cut-off events. [2024-11-28 05:12:19,937 INFO L125 PetriNetUnfolderBase]: For 123/137 co-relation queries the response was YES. [2024-11-28 05:12:19,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 6416 events. 160/6416 cut-off events. For 123/137 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 63392 event pairs, 6 based on Foata normal form. 0/5896 useless extension candidates. Maximal degree in co-relation 7109. Up to 106 conditions per place. [2024-11-28 05:12:19,985 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 24 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2024-11-28 05:12:19,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 637 transitions, 1534 flow [2024-11-28 05:12:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2044 transitions. [2024-11-28 05:12:19,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9502556950255695 [2024-11-28 05:12:19,987 INFO L175 Difference]: Start difference. First operand has 639 places, 635 transitions, 1476 flow. Second operand 3 states and 2044 transitions. [2024-11-28 05:12:19,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 637 transitions, 1534 flow [2024-11-28 05:12:19,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 637 transitions, 1528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:19,998 INFO L231 Difference]: Finished difference. Result has 638 places, 635 transitions, 1480 flow [2024-11-28 05:12:19,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=638, PETRI_TRANSITIONS=635} [2024-11-28 05:12:19,999 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -31 predicate places. [2024-11-28 05:12:19,999 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 635 transitions, 1480 flow [2024-11-28 05:12:20,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.6666666666666) internal successors, (2024), 3 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:20,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:20,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:20,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:12:20,001 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:20,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash -41996765, now seen corresponding path program 1 times [2024-11-28 05:12:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432843343] [2024-11-28 05:12:20,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:20,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432843343] [2024-11-28 05:12:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432843343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:20,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:20,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:12:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244849934] [2024-11-28 05:12:20,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:20,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:20,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:20,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:20,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 685 out of 717 [2024-11-28 05:12:20,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 635 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:20,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:20,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 685 of 717 [2024-11-28 05:12:20,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:21,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 462#L60-33true, 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:21,029 INFO L294 olderBase$Statistics]: this new event has 381 ancestors and is cut-off event [2024-11-28 05:12:21,029 INFO L297 olderBase$Statistics]: existing Event has 417 ancestors and is cut-off event [2024-11-28 05:12:21,029 INFO L297 olderBase$Statistics]: existing Event has 409 ancestors and is cut-off event [2024-11-28 05:12:21,029 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-28 05:12:21,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 462#L60-33true, 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:21,078 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-28 05:12:21,078 INFO L297 olderBase$Statistics]: existing Event has 421 ancestors and is cut-off event [2024-11-28 05:12:21,078 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2024-11-28 05:12:21,078 INFO L297 olderBase$Statistics]: existing Event has 401 ancestors and is cut-off event [2024-11-28 05:12:21,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][572], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, Black: 819#true, 545#L60-67true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:21,116 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2024-11-28 05:12:21,116 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-11-28 05:12:21,116 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-11-28 05:12:21,116 INFO L297 olderBase$Statistics]: existing Event has 459 ancestors and is cut-off event [2024-11-28 05:12:21,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][572], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 545#L60-67true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:21,138 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2024-11-28 05:12:21,138 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-28 05:12:21,138 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2024-11-28 05:12:21,138 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2024-11-28 05:12:21,160 INFO L124 PetriNetUnfolderBase]: 146/5998 cut-off events. [2024-11-28 05:12:21,160 INFO L125 PetriNetUnfolderBase]: For 91/107 co-relation queries the response was YES. [2024-11-28 05:12:21,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 5998 events. 146/5998 cut-off events. For 91/107 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 56475 event pairs, 10 based on Foata normal form. 0/5526 useless extension candidates. Maximal degree in co-relation 6744. Up to 173 conditions per place. [2024-11-28 05:12:21,203 INFO L140 encePairwiseOnDemand]: 713/717 looper letters, 11 selfloop transitions, 3 changer transitions 0/638 dead transitions. [2024-11-28 05:12:21,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 638 transitions, 1515 flow [2024-11-28 05:12:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2070 transitions. [2024-11-28 05:12:21,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9623430962343096 [2024-11-28 05:12:21,205 INFO L175 Difference]: Start difference. First operand has 638 places, 635 transitions, 1480 flow. Second operand 3 states and 2070 transitions. [2024-11-28 05:12:21,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 638 transitions, 1515 flow [2024-11-28 05:12:21,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 638 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:12:21,215 INFO L231 Difference]: Finished difference. Result has 642 places, 637 transitions, 1502 flow [2024-11-28 05:12:21,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=642, PETRI_TRANSITIONS=637} [2024-11-28 05:12:21,216 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -27 predicate places. [2024-11-28 05:12:21,216 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 637 transitions, 1502 flow [2024-11-28 05:12:21,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:21,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:21,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:21,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:12:21,218 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:21,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash -459419300, now seen corresponding path program 1 times [2024-11-28 05:12:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:21,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323177097] [2024-11-28 05:12:21,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323177097] [2024-11-28 05:12:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323177097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76985264] [2024-11-28 05:12:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:21,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:21,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:21,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:21,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:21,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 637 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:21,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:21,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:21,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:22,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 828#true, Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:22,603 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is not cut-off event [2024-11-28 05:12:22,604 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-11-28 05:12:22,604 INFO L297 olderBase$Statistics]: existing Event has 448 ancestors and is not cut-off event [2024-11-28 05:12:22,604 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-28 05:12:22,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][620], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 823#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 828#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:22,606 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is not cut-off event [2024-11-28 05:12:22,606 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2024-11-28 05:12:22,606 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-28 05:12:22,606 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2024-11-28 05:12:22,608 INFO L124 PetriNetUnfolderBase]: 112/6394 cut-off events. [2024-11-28 05:12:22,608 INFO L125 PetriNetUnfolderBase]: For 139/179 co-relation queries the response was YES. [2024-11-28 05:12:22,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7344 conditions, 6394 events. 112/6394 cut-off events. For 139/179 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 62770 event pairs, 2 based on Foata normal form. 0/5990 useless extension candidates. Maximal degree in co-relation 7289. Up to 100 conditions per place. [2024-11-28 05:12:22,634 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 12 selfloop transitions, 1 changer transitions 0/638 dead transitions. [2024-11-28 05:12:22,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 638 transitions, 1533 flow [2024-11-28 05:12:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2024-11-28 05:12:22,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609483960948396 [2024-11-28 05:12:22,636 INFO L175 Difference]: Start difference. First operand has 642 places, 637 transitions, 1502 flow. Second operand 3 states and 2067 transitions. [2024-11-28 05:12:22,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 638 transitions, 1533 flow [2024-11-28 05:12:22,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 638 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:22,643 INFO L231 Difference]: Finished difference. Result has 640 places, 635 transitions, 1494 flow [2024-11-28 05:12:22,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=640, PETRI_TRANSITIONS=635} [2024-11-28 05:12:22,644 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -29 predicate places. [2024-11-28 05:12:22,644 INFO L471 AbstractCegarLoop]: Abstraction has has 640 places, 635 transitions, 1494 flow [2024-11-28 05:12:22,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:22,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:22,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:22,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 05:12:22,646 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:22,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:22,648 INFO L85 PathProgramCache]: Analyzing trace with hash 879737728, now seen corresponding path program 1 times [2024-11-28 05:12:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:22,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668481399] [2024-11-28 05:12:22,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:22,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668481399] [2024-11-28 05:12:22,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668481399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:22,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:22,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307558787] [2024-11-28 05:12:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:22,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:22,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:22,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:22,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:22,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:22,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 635 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:22,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:22,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:22,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:23,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][618], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 699#(= |#race~id_0~0| 0), 831#true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 828#true, Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 756#(<= 2147483647 ~id_0~0), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:23,795 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is not cut-off event [2024-11-28 05:12:23,795 INFO L297 olderBase$Statistics]: existing Event has 448 ancestors and is not cut-off event [2024-11-28 05:12:23,795 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-28 05:12:23,795 INFO L297 olderBase$Statistics]: existing Event has 468 ancestors and is not cut-off event [2024-11-28 05:12:23,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][618], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 831#true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), 828#true, Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:23,798 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is not cut-off event [2024-11-28 05:12:23,798 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-28 05:12:23,798 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is not cut-off event [2024-11-28 05:12:23,798 INFO L297 olderBase$Statistics]: existing Event has 480 ancestors and is not cut-off event [2024-11-28 05:12:23,801 INFO L124 PetriNetUnfolderBase]: 110/5956 cut-off events. [2024-11-28 05:12:23,801 INFO L125 PetriNetUnfolderBase]: For 69/85 co-relation queries the response was YES. [2024-11-28 05:12:23,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6810 conditions, 5956 events. 110/5956 cut-off events. For 69/85 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 56834 event pairs, 2 based on Foata normal form. 0/5592 useless extension candidates. Maximal degree in co-relation 6755. Up to 100 conditions per place. [2024-11-28 05:12:23,841 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 12 selfloop transitions, 1 changer transitions 0/636 dead transitions. [2024-11-28 05:12:23,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 636 transitions, 1525 flow [2024-11-28 05:12:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2024-11-28 05:12:23,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609483960948396 [2024-11-28 05:12:23,844 INFO L175 Difference]: Start difference. First operand has 640 places, 635 transitions, 1494 flow. Second operand 3 states and 2067 transitions. [2024-11-28 05:12:23,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 636 transitions, 1525 flow [2024-11-28 05:12:23,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 636 transitions, 1524 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:12:23,856 INFO L231 Difference]: Finished difference. Result has 639 places, 633 transitions, 1491 flow [2024-11-28 05:12:23,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1491, PETRI_PLACES=639, PETRI_TRANSITIONS=633} [2024-11-28 05:12:23,857 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -30 predicate places. [2024-11-28 05:12:23,857 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 633 transitions, 1491 flow [2024-11-28 05:12:23,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:23,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:23,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:23,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 05:12:23,858 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:23,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash -820754191, now seen corresponding path program 1 times [2024-11-28 05:12:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646150510] [2024-11-28 05:12:23,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:23,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646150510] [2024-11-28 05:12:23,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646150510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:23,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826111348] [2024-11-28 05:12:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:23,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:23,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:23,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:23,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:23,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 633 transitions, 1491 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:23,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:23,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:23,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:25,537 INFO L124 PetriNetUnfolderBase]: 120/6482 cut-off events. [2024-11-28 05:12:25,537 INFO L125 PetriNetUnfolderBase]: For 107/127 co-relation queries the response was YES. [2024-11-28 05:12:25,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7418 conditions, 6482 events. 120/6482 cut-off events. For 107/127 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 61258 event pairs, 6 based on Foata normal form. 0/6100 useless extension candidates. Maximal degree in co-relation 7363. Up to 108 conditions per place. [2024-11-28 05:12:25,586 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 11 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2024-11-28 05:12:25,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 633 transitions, 1517 flow [2024-11-28 05:12:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2066 transitions. [2024-11-28 05:12:25,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604834960483496 [2024-11-28 05:12:25,589 INFO L175 Difference]: Start difference. First operand has 639 places, 633 transitions, 1491 flow. Second operand 3 states and 2066 transitions. [2024-11-28 05:12:25,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 633 transitions, 1517 flow [2024-11-28 05:12:25,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 633 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:12:25,601 INFO L231 Difference]: Finished difference. Result has 638 places, 631 transitions, 1488 flow [2024-11-28 05:12:25,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=638, PETRI_TRANSITIONS=631} [2024-11-28 05:12:25,602 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -31 predicate places. [2024-11-28 05:12:25,602 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 631 transitions, 1488 flow [2024-11-28 05:12:25,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:25,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:25,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:25,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 05:12:25,604 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:25,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1529263349, now seen corresponding path program 1 times [2024-11-28 05:12:25,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649523499] [2024-11-28 05:12:25,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:25,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:25,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649523499] [2024-11-28 05:12:25,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649523499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:25,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:25,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:25,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097920600] [2024-11-28 05:12:25,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:25,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:25,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:25,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:25,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:25,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:25,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 631 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:25,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:25,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:25,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:26,881 INFO L124 PetriNetUnfolderBase]: 120/6342 cut-off events. [2024-11-28 05:12:26,881 INFO L125 PetriNetUnfolderBase]: For 107/127 co-relation queries the response was YES. [2024-11-28 05:12:26,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7276 conditions, 6342 events. 120/6342 cut-off events. For 107/127 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 59628 event pairs, 6 based on Foata normal form. 0/6000 useless extension candidates. Maximal degree in co-relation 7221. Up to 108 conditions per place. [2024-11-28 05:12:26,917 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 11 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2024-11-28 05:12:26,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 631 transitions, 1514 flow [2024-11-28 05:12:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2066 transitions. [2024-11-28 05:12:26,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604834960483496 [2024-11-28 05:12:26,919 INFO L175 Difference]: Start difference. First operand has 638 places, 631 transitions, 1488 flow. Second operand 3 states and 2066 transitions. [2024-11-28 05:12:26,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 631 transitions, 1514 flow [2024-11-28 05:12:26,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 631 transitions, 1513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:12:26,927 INFO L231 Difference]: Finished difference. Result has 637 places, 629 transitions, 1485 flow [2024-11-28 05:12:26,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1485, PETRI_PLACES=637, PETRI_TRANSITIONS=629} [2024-11-28 05:12:26,929 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -32 predicate places. [2024-11-28 05:12:26,929 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 629 transitions, 1485 flow [2024-11-28 05:12:26,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:26,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:26,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:26,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 05:12:26,930 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:26,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:26,932 INFO L85 PathProgramCache]: Analyzing trace with hash 637992637, now seen corresponding path program 1 times [2024-11-28 05:12:26,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:26,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472749745] [2024-11-28 05:12:26,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472749745] [2024-11-28 05:12:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472749745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688928611] [2024-11-28 05:12:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:27,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:27,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:27,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:27,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 629 transitions, 1485 flow. Second operand has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:27,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:27,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:27,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:28,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][612], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 837#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:28,172 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-11-28 05:12:28,173 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is not cut-off event [2024-11-28 05:12:28,173 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-28 05:12:28,173 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-28 05:12:28,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][612], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, 837#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), Black: 799#true, 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:28,175 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is not cut-off event [2024-11-28 05:12:28,176 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-28 05:12:28,176 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-28 05:12:28,176 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is not cut-off event [2024-11-28 05:12:28,178 INFO L124 PetriNetUnfolderBase]: 116/6104 cut-off events. [2024-11-28 05:12:28,178 INFO L125 PetriNetUnfolderBase]: For 73/141 co-relation queries the response was YES. [2024-11-28 05:12:28,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 6104 events. 116/6104 cut-off events. For 73/141 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 58393 event pairs, 12 based on Foata normal form. 2/5832 useless extension candidates. Maximal degree in co-relation 7123. Up to 196 conditions per place. [2024-11-28 05:12:28,213 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/629 dead transitions. [2024-11-28 05:12:28,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 629 transitions, 1510 flow [2024-11-28 05:12:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-28 05:12:28,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-28 05:12:28,215 INFO L175 Difference]: Start difference. First operand has 637 places, 629 transitions, 1485 flow. Second operand 3 states and 2065 transitions. [2024-11-28 05:12:28,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 629 transitions, 1510 flow [2024-11-28 05:12:28,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 629 transitions, 1509 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:12:28,222 INFO L231 Difference]: Finished difference. Result has 637 places, 628 transitions, 1486 flow [2024-11-28 05:12:28,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=637, PETRI_TRANSITIONS=628} [2024-11-28 05:12:28,223 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -32 predicate places. [2024-11-28 05:12:28,223 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 628 transitions, 1486 flow [2024-11-28 05:12:28,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 685.6666666666666) internal successors, (2057), 3 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:28,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:28,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:28,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 05:12:28,224 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1350709985, now seen corresponding path program 1 times [2024-11-28 05:12:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:28,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419340350] [2024-11-28 05:12:28,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419340350] [2024-11-28 05:12:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419340350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959151196] [2024-11-28 05:12:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:28,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:28,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:28,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:28,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 628 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:28,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:28,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:28,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:29,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 465#L60-62true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,198 INFO L294 olderBase$Statistics]: this new event has 462 ancestors and is cut-off event [2024-11-28 05:12:29,198 INFO L297 olderBase$Statistics]: existing Event has 470 ancestors and is cut-off event [2024-11-28 05:12:29,198 INFO L297 olderBase$Statistics]: existing Event has 454 ancestors and is cut-off event [2024-11-28 05:12:29,199 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is cut-off event [2024-11-28 05:12:29,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 465#L60-62true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,242 INFO L294 olderBase$Statistics]: this new event has 482 ancestors and is cut-off event [2024-11-28 05:12:29,242 INFO L297 olderBase$Statistics]: existing Event has 466 ancestors and is cut-off event [2024-11-28 05:12:29,242 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is cut-off event [2024-11-28 05:12:29,242 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is cut-off event [2024-11-28 05:12:29,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L60-61-->L60-62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet26#1][531], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 465#L60-62true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,276 INFO L294 olderBase$Statistics]: this new event has 454 ancestors and is not cut-off event [2024-11-28 05:12:29,276 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is not cut-off event [2024-11-28 05:12:29,276 INFO L297 olderBase$Statistics]: existing Event has 470 ancestors and is not cut-off event [2024-11-28 05:12:29,276 INFO L297 olderBase$Statistics]: existing Event has 462 ancestors and is not cut-off event [2024-11-28 05:12:29,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 845#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,276 INFO L294 olderBase$Statistics]: this new event has 455 ancestors and is cut-off event [2024-11-28 05:12:29,277 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2024-11-28 05:12:29,277 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-28 05:12:29,277 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2024-11-28 05:12:29,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 845#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 316#L60-64true, 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,279 INFO L294 olderBase$Statistics]: this new event has 456 ancestors and is cut-off event [2024-11-28 05:12:29,279 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2024-11-28 05:12:29,279 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is cut-off event [2024-11-28 05:12:29,279 INFO L297 olderBase$Statistics]: existing Event has 464 ancestors and is cut-off event [2024-11-28 05:12:29,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 466#L62true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,286 INFO L294 olderBase$Statistics]: this new event has 465 ancestors and is cut-off event [2024-11-28 05:12:29,286 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2024-11-28 05:12:29,286 INFO L297 olderBase$Statistics]: existing Event has 473 ancestors and is cut-off event [2024-11-28 05:12:29,287 INFO L297 olderBase$Statistics]: existing Event has 481 ancestors and is cut-off event [2024-11-28 05:12:29,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L60-61-->L60-62: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet26#1][531], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 465#L60-62true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,288 INFO L294 olderBase$Statistics]: this new event has 466 ancestors and is not cut-off event [2024-11-28 05:12:29,288 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is not cut-off event [2024-11-28 05:12:29,288 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is not cut-off event [2024-11-28 05:12:29,288 INFO L297 olderBase$Statistics]: existing Event has 474 ancestors and is not cut-off event [2024-11-28 05:12:29,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, 845#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,288 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is cut-off event [2024-11-28 05:12:29,288 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2024-11-28 05:12:29,288 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2024-11-28 05:12:29,288 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is cut-off event [2024-11-28 05:12:29,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, 845#(= |thread2Thread1of1ForFork0_#t~nondet26#1| |#race~result_9~0|), Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, 316#L60-64true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,289 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is cut-off event [2024-11-28 05:12:29,290 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is cut-off event [2024-11-28 05:12:29,290 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is cut-off event [2024-11-28 05:12:29,290 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is cut-off event [2024-11-28 05:12:29,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), 840#true, Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 466#L62true, 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:29,297 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-28 05:12:29,297 INFO L297 olderBase$Statistics]: existing Event has 485 ancestors and is cut-off event [2024-11-28 05:12:29,297 INFO L297 olderBase$Statistics]: existing Event has 493 ancestors and is cut-off event [2024-11-28 05:12:29,297 INFO L297 olderBase$Statistics]: existing Event has 485 ancestors and is cut-off event [2024-11-28 05:12:29,302 INFO L124 PetriNetUnfolderBase]: 158/6108 cut-off events. [2024-11-28 05:12:29,302 INFO L125 PetriNetUnfolderBase]: For 147/165 co-relation queries the response was YES. [2024-11-28 05:12:29,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 6108 events. 158/6108 cut-off events. For 147/165 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 57835 event pairs, 16 based on Foata normal form. 0/5824 useless extension candidates. Maximal degree in co-relation 7243. Up to 224 conditions per place. [2024-11-28 05:12:29,352 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 10 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2024-11-28 05:12:29,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 628 transitions, 1511 flow [2024-11-28 05:12:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2024-11-28 05:12:29,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9600185960018596 [2024-11-28 05:12:29,355 INFO L175 Difference]: Start difference. First operand has 637 places, 628 transitions, 1486 flow. Second operand 3 states and 2065 transitions. [2024-11-28 05:12:29,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 628 transitions, 1511 flow [2024-11-28 05:12:29,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 628 transitions, 1507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:29,365 INFO L231 Difference]: Finished difference. Result has 636 places, 627 transitions, 1484 flow [2024-11-28 05:12:29,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=636, PETRI_TRANSITIONS=627} [2024-11-28 05:12:29,367 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -33 predicate places. [2024-11-28 05:12:29,367 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 627 transitions, 1484 flow [2024-11-28 05:12:29,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.0) internal successors, (2058), 3 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:29,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:29,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:29,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 05:12:29,368 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:29,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1508192793, now seen corresponding path program 1 times [2024-11-28 05:12:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405282400] [2024-11-28 05:12:29,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:29,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:29,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405282400] [2024-11-28 05:12:29,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405282400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:29,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:29,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:29,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243668006] [2024-11-28 05:12:29,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:29,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:29,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:29,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:29,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:29,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 627 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:29,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:29,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:29,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:30,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:30,617 INFO L294 olderBase$Statistics]: this new event has 468 ancestors and is not cut-off event [2024-11-28 05:12:30,617 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-28 05:12:30,617 INFO L297 olderBase$Statistics]: existing Event has 484 ancestors and is not cut-off event [2024-11-28 05:12:30,617 INFO L297 olderBase$Statistics]: existing Event has 476 ancestors and is not cut-off event [2024-11-28 05:12:30,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1886] thread2EXIT-->L90: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][610], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 843#true, Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), 495#L90true, Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 825#(not |thread2Thread1of1ForFork0_#t~short20#1|), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:30,619 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is not cut-off event [2024-11-28 05:12:30,619 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-28 05:12:30,619 INFO L297 olderBase$Statistics]: existing Event has 496 ancestors and is not cut-off event [2024-11-28 05:12:30,619 INFO L297 olderBase$Statistics]: existing Event has 488 ancestors and is not cut-off event [2024-11-28 05:12:30,621 INFO L124 PetriNetUnfolderBase]: 98/5948 cut-off events. [2024-11-28 05:12:30,621 INFO L125 PetriNetUnfolderBase]: For 73/111 co-relation queries the response was YES. [2024-11-28 05:12:30,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 5948 events. 98/5948 cut-off events. For 73/111 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 56262 event pairs, 6 based on Foata normal form. 0/5734 useless extension candidates. Maximal degree in co-relation 6879. Up to 124 conditions per place. [2024-11-28 05:12:30,641 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 9 selfloop transitions, 1 changer transitions 0/625 dead transitions. [2024-11-28 05:12:30,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1500 flow [2024-11-28 05:12:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2024-11-28 05:12:30,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9595536959553695 [2024-11-28 05:12:30,643 INFO L175 Difference]: Start difference. First operand has 636 places, 627 transitions, 1484 flow. Second operand 3 states and 2064 transitions. [2024-11-28 05:12:30,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1500 flow [2024-11-28 05:12:30,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 625 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:12:30,653 INFO L231 Difference]: Finished difference. Result has 634 places, 625 transitions, 1478 flow [2024-11-28 05:12:30,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=634, PETRI_TRANSITIONS=625} [2024-11-28 05:12:30,655 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -35 predicate places. [2024-11-28 05:12:30,655 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 625 transitions, 1478 flow [2024-11-28 05:12:30,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:30,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:12:30,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:30,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 05:12:30,656 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 126 more)] === [2024-11-28 05:12:30,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash -243534002, now seen corresponding path program 1 times [2024-11-28 05:12:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:30,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755584420] [2024-11-28 05:12:30,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:12:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:30,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:30,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755584420] [2024-11-28 05:12:30,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755584420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:30,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:30,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:12:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569511998] [2024-11-28 05:12:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:30,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:12:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:30,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:12:30,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:12:30,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 717 [2024-11-28 05:12:30,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 625 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:30,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:12:30,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 717 [2024-11-28 05:12:30,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:12:31,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, Black: 819#true, 705#(= |#race~id_3~0| 0), 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:31,834 INFO L294 olderBase$Statistics]: this new event has 463 ancestors and is cut-off event [2024-11-28 05:12:31,834 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-28 05:12:31,834 INFO L297 olderBase$Statistics]: existing Event has 455 ancestors and is cut-off event [2024-11-28 05:12:31,834 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is cut-off event [2024-11-28 05:12:31,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1885] thread1EXIT-->L89-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][562], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:31,856 INFO L294 olderBase$Statistics]: this new event has 475 ancestors and is cut-off event [2024-11-28 05:12:31,856 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is cut-off event [2024-11-28 05:12:31,856 INFO L297 olderBase$Statistics]: existing Event has 467 ancestors and is cut-off event [2024-11-28 05:12:31,856 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is cut-off event [2024-11-28 05:12:31,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1824] L60-62-->L60-63: Formula: (= |v_#race~result_9~0_1| |v_thread2Thread1of1ForFork0_#t~nondet26#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_1|} AuxVars[] AssignedVars[#race~result_9~0][536], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, 747#(= |#race~get_2~0| 0), Black: 745#true, Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), Black: 823#true, 751#(= |#race~get_5~0| 0), Black: 756#(<= 2147483647 ~id_0~0), 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:31,873 INFO L294 olderBase$Statistics]: this new event has 455 ancestors and is not cut-off event [2024-11-28 05:12:31,873 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-11-28 05:12:31,873 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is not cut-off event [2024-11-28 05:12:31,873 INFO L297 olderBase$Statistics]: existing Event has 463 ancestors and is not cut-off event [2024-11-28 05:12:31,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1824] L60-62-->L60-63: Formula: (= |v_#race~result_9~0_1| |v_thread2Thread1of1ForFork0_#t~nondet26#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet26#1=|v_thread2Thread1of1ForFork0_#t~nondet26#1_3|, #race~result_9~0=|v_#race~result_9~0_1|} AuxVars[] AssignedVars[#race~result_9~0][536], [Black: 761#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 763#(and (<= 2147483647 ~id_0~0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 773#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), Black: 770#true, Black: 772#(= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0), Black: 774#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 788#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 3 ~get_5~0.offset)) 0)), Black: 786#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 787#(and (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) 2 ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0) (= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset 1)) 0)), Black: 783#true, Black: 785#(= (select (select |#race| ~get_5~0.base) (+ (* ~id_3~0 4) ~get_5~0.offset)) 0), 202#L60-63true, Black: 799#true, 808#(= (select (select |#race| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 0), 756#(<= 2147483647 ~id_0~0), 699#(= |#race~id_0~0| 0), 224#L89-1true, Black: 806#true, Black: 745#true, 747#(= |#race~get_2~0| 0), Black: 810#true, 849#true, Black: 749#true, Black: 816#(not |thread1Thread1of1ForFork1_#t~short7#1|), 775#(and (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset 1)) 0) (= (select (select |#race| ~get_2~0.base) (+ 2 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ 3 (* ~id_0~0 4) ~get_2~0.offset)) 0) (= (select (select |#race| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 0)), 846#true, 705#(= |#race~id_3~0| 0), Black: 819#true, 801#(= |#race~contains_key_1~0| 0), 812#(= |#race~contains_key_4~0| 0), 751#(= |#race~get_5~0| 0), Black: 823#true, 821#(= 0 (select (select |#race| ~contains_key_4~0.base) (+ ~id_3~0 ~contains_key_4~0.offset))), Black: 765#(and (<= 2147483647 ~id_0~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 2147483648 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-28 05:12:31,877 INFO L294 olderBase$Statistics]: this new event has 467 ancestors and is not cut-off event [2024-11-28 05:12:31,877 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is not cut-off event [2024-11-28 05:12:31,878 INFO L297 olderBase$Statistics]: existing Event has 475 ancestors and is not cut-off event [2024-11-28 05:12:31,878 INFO L297 olderBase$Statistics]: existing Event has 483 ancestors and is not cut-off event [2024-11-28 05:12:31,884 INFO L124 PetriNetUnfolderBase]: 104/5994 cut-off events. [2024-11-28 05:12:31,884 INFO L125 PetriNetUnfolderBase]: For 93/111 co-relation queries the response was YES. [2024-11-28 05:12:31,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 5994 events. 104/5994 cut-off events. For 93/111 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 56112 event pairs, 8 based on Foata normal form. 8/5784 useless extension candidates. Maximal degree in co-relation 6845. Up to 138 conditions per place. [2024-11-28 05:12:31,923 INFO L140 encePairwiseOnDemand]: 714/717 looper letters, 0 selfloop transitions, 0 changer transitions 623/623 dead transitions. [2024-11-28 05:12:31,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 623 transitions, 1492 flow [2024-11-28 05:12:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:12:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:12:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2063 transitions. [2024-11-28 05:12:31,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9590887959088796 [2024-11-28 05:12:31,925 INFO L175 Difference]: Start difference. First operand has 634 places, 625 transitions, 1478 flow. Second operand 3 states and 2063 transitions. [2024-11-28 05:12:31,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 623 transitions, 1492 flow [2024-11-28 05:12:31,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 623 transitions, 1491 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:12:31,931 INFO L231 Difference]: Finished difference. Result has 633 places, 0 transitions, 0 flow [2024-11-28 05:12:31,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=717, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=633, PETRI_TRANSITIONS=0} [2024-11-28 05:12:31,932 INFO L279 CegarLoopForPetriNet]: 669 programPoint places, -36 predicate places. [2024-11-28 05:12:31,932 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 0 transitions, 0 flow [2024-11-28 05:12:31,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 686.6666666666666) internal successors, (2060), 3 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:31,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (129 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (128 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (127 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (126 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (125 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (124 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (123 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (122 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (121 of 130 remaining) [2024-11-28 05:12:31,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (120 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (119 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (118 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (117 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (116 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (115 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (114 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (113 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (112 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (111 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (110 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (109 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (108 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (107 of 130 remaining) [2024-11-28 05:12:31,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (106 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (105 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (104 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (103 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (102 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (101 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (100 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (98 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (97 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (96 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (95 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (94 of 130 remaining) [2024-11-28 05:12:31,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (93 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (92 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (91 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (90 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (89 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (88 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (87 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (86 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (85 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (84 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (83 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (82 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (81 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (80 of 130 remaining) [2024-11-28 05:12:31,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (79 of 130 remaining) [2024-11-28 05:12:31,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (78 of 130 remaining) [2024-11-28 05:12:31,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (77 of 130 remaining) [2024-11-28 05:12:31,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 130 remaining) [2024-11-28 05:12:31,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (75 of 130 remaining) [2024-11-28 05:12:31,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 130 remaining) [2024-11-28 05:12:31,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (73 of 130 remaining) [2024-11-28 05:12:31,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (72 of 130 remaining) [2024-11-28 05:12:31,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (71 of 130 remaining) [2024-11-28 05:12:31,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (69 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (68 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (67 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (65 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (64 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (63 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (62 of 130 remaining) [2024-11-28 05:12:31,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (60 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (59 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (58 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (57 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (56 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (55 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (54 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (53 of 130 remaining) [2024-11-28 05:12:31,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (52 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 130 remaining) [2024-11-28 05:12:31,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 130 remaining) [2024-11-28 05:12:31,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 130 remaining) [2024-11-28 05:12:31,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (41 of 130 remaining) [2024-11-28 05:12:31,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (40 of 130 remaining) [2024-11-28 05:12:31,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (39 of 130 remaining) [2024-11-28 05:12:31,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (38 of 130 remaining) [2024-11-28 05:12:31,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (37 of 130 remaining) [2024-11-28 05:12:31,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (36 of 130 remaining) [2024-11-28 05:12:31,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (33 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (32 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (29 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (28 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (27 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (26 of 130 remaining) [2024-11-28 05:12:31,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (25 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 130 remaining) [2024-11-28 05:12:31,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (12 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (11 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (10 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (8 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (7 of 130 remaining) [2024-11-28 05:12:31,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (6 of 130 remaining) [2024-11-28 05:12:31,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (5 of 130 remaining) [2024-11-28 05:12:31,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 130 remaining) [2024-11-28 05:12:31,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (3 of 130 remaining) [2024-11-28 05:12:31,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 130 remaining) [2024-11-28 05:12:31,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 130 remaining) [2024-11-28 05:12:31,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 130 remaining) [2024-11-28 05:12:31,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 05:12:31,950 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:12:31,960 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 05:12:31,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:12:31,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:12:31 BasicIcfg [2024-11-28 05:12:31,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:12:31,967 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:12:31,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:12:31,968 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:12:31,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:11:50" (3/4) ... [2024-11-28 05:12:31,970 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 05:12:31,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-28 05:12:31,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-28 05:12:31,982 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2024-11-28 05:12:31,982 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 05:12:31,983 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 05:12:31,983 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 05:12:32,092 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 05:12:32,093 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 05:12:32,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:12:32,095 INFO L158 Benchmark]: Toolchain (without parser) took 43264.86ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 94.0MB in the beginning and 795.4MB in the end (delta: -701.4MB). Peak memory consumption was 651.4MB. Max. memory is 16.1GB. [2024-11-28 05:12:32,095 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:12:32,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.76ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 79.7MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:12:32,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.26ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 75.9MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:12:32,096 INFO L158 Benchmark]: Boogie Preprocessor took 51.97ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 72.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:12:32,096 INFO L158 Benchmark]: RCFGBuilder took 1541.81ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 77.9MB in the end (delta: -5.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-11-28 05:12:32,097 INFO L158 Benchmark]: TraceAbstraction took 41111.58ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 77.4MB in the beginning and 803.8MB in the end (delta: -726.4MB). Peak memory consumption was 628.1MB. Max. memory is 16.1GB. [2024-11-28 05:12:32,097 INFO L158 Benchmark]: Witness Printer took 126.32ms. Allocated memory is still 1.5GB. Free memory was 803.8MB in the beginning and 795.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:12:32,100 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.76ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 79.7MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.26ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 75.9MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.97ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 72.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1541.81ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 77.9MB in the end (delta: -5.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41111.58ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 77.4MB in the beginning and 803.8MB in the end (delta: -726.4MB). Peak memory consumption was 628.1MB. Max. memory is 16.1GB. * Witness Printer took 126.32ms. Allocated memory is still 1.5GB. Free memory was 803.8MB in the beginning and 795.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 985 locations, 130 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.7s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2819 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1251 mSDsluCounter, 821 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 472 mSDsCounter, 552 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3587 IncrementalHoareTripleChecker+Invalid, 4139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 552 mSolverCounterUnsat, 349 mSDtfsCounter, 3587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1502occurred in iteration=31, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 8741 NumberOfCodeBlocks, 8741 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 8702 ConstructedInterpolants, 0 QuantifiedInterpolants, 9201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 05:12:32,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c021e2a6-20ca-4c0b-88b5-d09c04ebe26b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE