./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd --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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:49:21,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:49:21,995 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-13 13:49:22,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:49:22,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:49:22,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:49:22,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:49:22,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:49:22,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:49:22,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:49:22,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:49:22,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:49:22,041 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:49:22,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:49:22,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:49:22,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:49:22,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:49:22,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:49:22,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:49:22,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:49:22,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:49:22,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:49:22,042 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 13:49:22,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:49:22,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:49:22,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:49:22,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:49:22,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:49:22,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:49:22,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:49:22,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:49:22,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:49:22,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:49:22,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:49:22,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:49:22,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:49:22,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:49:22,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:49:22,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:49:22,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:49:22,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:49:22,045 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_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2024-11-13 13:49:22,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:49:22,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:49:22,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:49:22,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:49:22,366 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:49:22,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c Unable to find full path for "g++" [2024-11-13 13:49:24,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:49:24,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:49:24,542 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-11-13 13:49:24,556 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/data/682165ec0/3f2390c83e54435bb339e2f2d7c3f98e/FLAG7e4c4ab81 [2024-11-13 13:49:24,582 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/data/682165ec0/3f2390c83e54435bb339e2f2d7c3f98e [2024-11-13 13:49:24,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:49:24,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:49:24,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:49:24,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:49:24,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:49:24,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:24,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a203221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24, skipping insertion in model container [2024-11-13 13:49:24,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:24,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:49:24,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:49:24,891 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:49:24,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:49:24,972 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:49:24,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24 WrapperNode [2024-11-13 13:49:24,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:49:24,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:49:24,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:49:24,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:49:24,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,040 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 378 [2024-11-13 13:49:25,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:49:25,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:49:25,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:49:25,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:49:25,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:49:25,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:49:25,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:49:25,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:49:25,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (1/1) ... [2024-11-13 13:49:25,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:49:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:49:25,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:49:25,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79544c12-ae0e-42ed-b98b-908d33638bfa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:49:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:49:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 13:49:25,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 13:49:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 13:49:25,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 13:49:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 13:49:25,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 13:49:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 13:49:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 13:49:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:49:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:49:25,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:49:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 13:49:25,167 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 13:49:25,334 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:49:25,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:49:26,194 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:49:26,194 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:49:26,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:49:26,234 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 13:49:26,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:49:26 BoogieIcfgContainer [2024-11-13 13:49:26,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:49:26,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:49:26,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:49:26,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:49:26,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:49:24" (1/3) ... [2024-11-13 13:49:26,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56baeea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:49:26, skipping insertion in model container [2024-11-13 13:49:26,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:24" (2/3) ... [2024-11-13 13:49:26,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56baeea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:49:26, skipping insertion in model container [2024-11-13 13:49:26,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:49:26" (3/3) ... [2024-11-13 13:49:26,266 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-11-13 13:49:26,281 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:49:26,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 490 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2024-11-13 13:49:26,282 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:49:26,467 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-13 13:49:26,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 518 transitions, 1057 flow [2024-11-13 13:49:26,814 INFO L124 PetriNetUnfolderBase]: 29/515 cut-off events. [2024-11-13 13:49:26,817 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 13:49:26,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 515 events. 29/515 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 877 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 339. Up to 2 conditions per place. [2024-11-13 13:49:26,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 518 transitions, 1057 flow [2024-11-13 13:49:26,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 471 transitions, 960 flow [2024-11-13 13:49:26,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:49:26,866 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;@15edfbd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:49:26,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-11-13 13:49:26,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:49:26,905 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-13 13:49:26,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:49:26,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:26,906 INFO L204 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] [2024-11-13 13:49:26,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:26,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1176998043, now seen corresponding path program 1 times [2024-11-13 13:49:26,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:26,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010391232] [2024-11-13 13:49:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:26,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,123 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-13 13:49:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010391232] [2024-11-13 13:49:27,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010391232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:27,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:27,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656416109] [2024-11-13 13:49:27,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:27,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:27,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:27,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 518 [2024-11-13 13:49:27,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 471 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-13 13:49:27,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:27,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 518 [2024-11-13 13:49:27,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:27,679 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2024-11-13 13:49:27,679 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-13 13:49:27,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1039 events. 33/1039 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5180 event pairs, 15 based on Foata normal form. 37/937 useless extension candidates. Maximal degree in co-relation 824. Up to 55 conditions per place. [2024-11-13 13:49:27,695 INFO L140 encePairwiseOnDemand]: 495/518 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2024-11-13 13:49:27,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2024-11-13 13:49:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-11-13 13:49:27,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-11-13 13:49:27,724 INFO L175 Difference]: Start difference. First operand has 455 places, 471 transitions, 960 flow. Second operand 3 states and 1463 transitions. [2024-11-13 13:49:27,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2024-11-13 13:49:27,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 13:49:27,750 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2024-11-13 13:49:27,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2024-11-13 13:49:27,762 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-13 13:49:27,762 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2024-11-13 13:49:27,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-13 13:49:27,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:27,765 INFO L204 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-13 13:49:27,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:49:27,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:27,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash -769708376, now seen corresponding path program 1 times [2024-11-13 13:49:27,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:27,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366192161] [2024-11-13 13:49:27,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:27,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,842 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-13 13:49:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366192161] [2024-11-13 13:49:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366192161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101089387] [2024-11-13 13:49:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:27,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:27,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 518 [2024-11-13 13:49:27,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 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-13 13:49:27,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:27,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 518 [2024-11-13 13:49:27,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:28,638 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2024-11-13 13:49:28,639 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-13 13:49:28,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2658 events. 100/2658 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 19656 event pairs, 56 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 2797. Up to 152 conditions per place. [2024-11-13 13:49:28,665 INFO L140 encePairwiseOnDemand]: 511/518 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2024-11-13 13:49:28,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2024-11-13 13:49:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2024-11-13 13:49:28,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2024-11-13 13:49:28,675 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2024-11-13 13:49:28,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2024-11-13 13:49:28,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:49:28,688 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2024-11-13 13:49:28,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2024-11-13 13:49:28,689 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-11-13 13:49:28,690 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2024-11-13 13:49:28,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 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-13 13:49:28,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:28,691 INFO L204 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] [2024-11-13 13:49:28,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:49:28,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:28,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1770189883, now seen corresponding path program 1 times [2024-11-13 13:49:28,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:28,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440818371] [2024-11-13 13:49:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:28,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,692 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-13 13:49:29,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440818371] [2024-11-13 13:49:29,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440818371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:29,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:29,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:49:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303377708] [2024-11-13 13:49:29,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:29,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:29,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:29,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:30,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 518 [2024-11-13 13:49:30,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 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-13 13:49:30,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:30,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 518 [2024-11-13 13:49:30,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:31,825 INFO L124 PetriNetUnfolderBase]: 1199/6233 cut-off events. [2024-11-13 13:49:31,827 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2024-11-13 13:49:31,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 6233 events. 1199/6233 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 54307 event pairs, 864 based on Foata normal form. 0/5379 useless extension candidates. Maximal degree in co-relation 8023. Up to 1772 conditions per place. [2024-11-13 13:49:31,891 INFO L140 encePairwiseOnDemand]: 500/518 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2024-11-13 13:49:31,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2024-11-13 13:49:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:49:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2024-11-13 13:49:31,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2024-11-13 13:49:31,901 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2024-11-13 13:49:31,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2024-11-13 13:49:31,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:49:31,910 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2024-11-13 13:49:31,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=907, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2024-11-13 13:49:31,912 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-11-13 13:49:31,913 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2024-11-13 13:49:31,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 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-13 13:49:31,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:31,915 INFO L204 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] [2024-11-13 13:49:31,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:49:31,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:31,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 543381560, now seen corresponding path program 1 times [2024-11-13 13:49:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175099764] [2024-11-13 13:49:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,976 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-13 13:49:31,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:31,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175099764] [2024-11-13 13:49:31,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175099764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:31,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:31,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:31,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861175999] [2024-11-13 13:49:31,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:31,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:31,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:31,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:32,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-13 13:49:32,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 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-13 13:49:32,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:32,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-13 13:49:32,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:32,139 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2024-11-13 13:49:32,139 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 13:49:32,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 623 events. 13/623 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1662 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 638. Up to 22 conditions per place. [2024-11-13 13:49:32,148 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-11-13 13:49:32,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2024-11-13 13:49:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-13 13:49:32,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-13 13:49:32,153 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2024-11-13 13:49:32,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2024-11-13 13:49:32,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 13:49:32,162 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2024-11-13 13:49:32,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=879, PETRI_PLACES=435, PETRI_TRANSITIONS=434} [2024-11-13 13:49:32,163 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2024-11-13 13:49:32,164 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2024-11-13 13:49:32,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 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-13 13:49:32,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:32,165 INFO L204 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-13 13:49:32,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:49:32,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:32,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:32,166 INFO L85 PathProgramCache]: Analyzing trace with hash 726400158, now seen corresponding path program 1 times [2024-11-13 13:49:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:32,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815449766] [2024-11-13 13:49:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:32,228 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-13 13:49:32,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:32,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815449766] [2024-11-13 13:49:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815449766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:32,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:32,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651967798] [2024-11-13 13:49:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:32,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:32,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:32,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:32,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:32,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-13 13:49:32,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 434 transitions, 879 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 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-13 13:49:32,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:32,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-13 13:49:32,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:32,417 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2024-11-13 13:49:32,417 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 13:49:32,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 563 events. 14/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1294 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 567. Up to 25 conditions per place. [2024-11-13 13:49:32,424 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-11-13 13:49:32,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2024-11-13 13:49:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-13 13:49:32,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-13 13:49:32,428 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2024-11-13 13:49:32,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2024-11-13 13:49:32,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:49:32,436 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2024-11-13 13:49:32,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=434, PETRI_TRANSITIONS=433} [2024-11-13 13:49:32,440 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-11-13 13:49:32,440 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2024-11-13 13:49:32,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 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-13 13:49:32,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:32,441 INFO L204 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] [2024-11-13 13:49:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:49:32,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:32,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:32,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1347714784, now seen corresponding path program 1 times [2024-11-13 13:49:32,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306401268] [2024-11-13 13:49:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:32,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:32,548 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-13 13:49:32,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:32,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306401268] [2024-11-13 13:49:32,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306401268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:32,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659833878] [2024-11-13 13:49:32,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:32,575 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-13 13:49:32,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 433 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 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-13 13:49:32,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:32,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-13 13:49:32,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:32,665 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2024-11-13 13:49:32,665 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 13:49:32,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 440 events. 10/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 792 event pairs, 4 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 438. Up to 20 conditions per place. [2024-11-13 13:49:32,669 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-11-13 13:49:32,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2024-11-13 13:49:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-13 13:49:32,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-13 13:49:32,672 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2024-11-13 13:49:32,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2024-11-13 13:49:32,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:49:32,679 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2024-11-13 13:49:32,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=433, PETRI_TRANSITIONS=432} [2024-11-13 13:49:32,683 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2024-11-13 13:49:32,683 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2024-11-13 13:49:32,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 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-13 13:49:32,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:32,684 INFO L204 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] [2024-11-13 13:49:32,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:49:32,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:32,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash -200548699, now seen corresponding path program 1 times [2024-11-13 13:49:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600529213] [2024-11-13 13:49:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:32,773 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-13 13:49:32,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:32,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600529213] [2024-11-13 13:49:32,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600529213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:32,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:32,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884653587] [2024-11-13 13:49:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:32,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:32,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-13 13:49:32,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 432 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 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-13 13:49:32,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:32,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-13 13:49:32,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:32,914 INFO L124 PetriNetUnfolderBase]: 15/547 cut-off events. [2024-11-13 13:49:32,914 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 13:49:32,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 547 events. 15/547 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1400 event pairs, 2 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 557. Up to 14 conditions per place. [2024-11-13 13:49:32,920 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2024-11-13 13:49:32,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2024-11-13 13:49:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2024-11-13 13:49:32,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9382239382239382 [2024-11-13 13:49:32,923 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2024-11-13 13:49:32,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2024-11-13 13:49:32,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:49:32,930 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2024-11-13 13:49:32,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=431, PETRI_TRANSITIONS=430} [2024-11-13 13:49:32,932 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2024-11-13 13:49:32,932 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2024-11-13 13:49:32,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 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-13 13:49:32,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:32,933 INFO L204 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] [2024-11-13 13:49:32,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:49:32,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:32,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash 546267015, now seen corresponding path program 1 times [2024-11-13 13:49:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:32,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745179154] [2024-11-13 13:49:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,008 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-13 13:49:33,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:33,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745179154] [2024-11-13 13:49:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745179154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505108011] [2024-11-13 13:49:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:33,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:33,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:33,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-13 13:49:33,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 430 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 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-13 13:49:33,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:33,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-13 13:49:33,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:33,256 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2024-11-13 13:49:33,256 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-13 13:49:33,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1093 events. 31/1093 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4672 event pairs, 2 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1137. Up to 46 conditions per place. [2024-11-13 13:49:33,267 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-11-13 13:49:33,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2024-11-13 13:49:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-11-13 13:49:33,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-11-13 13:49:33,271 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2024-11-13 13:49:33,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2024-11-13 13:49:33,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:49:33,281 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2024-11-13 13:49:33,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=430, PETRI_TRANSITIONS=430} [2024-11-13 13:49:33,282 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-11-13 13:49:33,282 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2024-11-13 13:49:33,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 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-13 13:49:33,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:33,283 INFO L204 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-13 13:49:33,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:49:33,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:33,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2111803358, now seen corresponding path program 1 times [2024-11-13 13:49:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:33,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098808213] [2024-11-13 13:49:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,393 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-13 13:49:33,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098808213] [2024-11-13 13:49:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098808213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:33,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:33,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:33,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218053632] [2024-11-13 13:49:33,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:33,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:33,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:33,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-13 13:49:33,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 430 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 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-13 13:49:33,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:33,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-13 13:49:33,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:33,689 INFO L124 PetriNetUnfolderBase]: 24/944 cut-off events. [2024-11-13 13:49:33,689 INFO L125 PetriNetUnfolderBase]: For 10/28 co-relation queries the response was YES. [2024-11-13 13:49:33,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 944 events. 24/944 cut-off events. For 10/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3320 event pairs, 3 based on Foata normal form. 4/856 useless extension candidates. Maximal degree in co-relation 974. Up to 19 conditions per place. [2024-11-13 13:49:33,702 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2024-11-13 13:49:33,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2024-11-13 13:49:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-11-13 13:49:33,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-11-13 13:49:33,708 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2024-11-13 13:49:33,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2024-11-13 13:49:33,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:49:33,718 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2024-11-13 13:49:33,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-11-13 13:49:33,719 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-11-13 13:49:33,719 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2024-11-13 13:49:33,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 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-13 13:49:33,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:33,721 INFO L204 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] [2024-11-13 13:49:33,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:49:33,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:33,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2076463584, now seen corresponding path program 1 times [2024-11-13 13:49:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:33,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431408375] [2024-11-13 13:49:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,817 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-13 13:49:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431408375] [2024-11-13 13:49:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431408375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:33,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:33,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549934925] [2024-11-13 13:49:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:33,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:33,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:33,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:33,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-13 13:49:33,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 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-13 13:49:33,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:33,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-13 13:49:33,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:34,354 INFO L124 PetriNetUnfolderBase]: 73/1869 cut-off events. [2024-11-13 13:49:34,354 INFO L125 PetriNetUnfolderBase]: For 25/29 co-relation queries the response was YES. [2024-11-13 13:49:34,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1869 events. 73/1869 cut-off events. For 25/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 11374 event pairs, 6 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 1989. Up to 93 conditions per place. [2024-11-13 13:49:34,377 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 15 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-11-13 13:49:34,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 915 flow [2024-11-13 13:49:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2024-11-13 13:49:34,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9407979407979408 [2024-11-13 13:49:34,382 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 3 states and 1462 transitions. [2024-11-13 13:49:34,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 915 flow [2024-11-13 13:49:34,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:49:34,391 INFO L231 Difference]: Finished difference. Result has 425 places, 424 transitions, 875 flow [2024-11-13 13:49:34,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=425, PETRI_TRANSITIONS=424} [2024-11-13 13:49:34,393 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -30 predicate places. [2024-11-13 13:49:34,393 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 424 transitions, 875 flow [2024-11-13 13:49:34,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 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-13 13:49:34,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:34,395 INFO L204 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] [2024-11-13 13:49:34,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:49:34,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:34,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash -640987701, now seen corresponding path program 1 times [2024-11-13 13:49:34,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:34,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398573544] [2024-11-13 13:49:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:34,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:34,705 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-13 13:49:34,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:34,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398573544] [2024-11-13 13:49:34,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398573544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:34,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:34,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:49:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179230904] [2024-11-13 13:49:34,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:34,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:49:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:49:34,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:35,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-13 13:49:35,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 424 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 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-13 13:49:35,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:35,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-13 13:49:35,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:35,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1409] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 85#L88true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 528#(= |#race~A~0| 0), Black: 533#true]) [2024-11-13 13:49:35,743 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2024-11-13 13:49:35,744 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 13:49:35,744 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-13 13:49:35,744 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-13 13:49:35,745 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1409] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 85#L88true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), Black: 533#true, 528#(= |#race~A~0| 0)]) [2024-11-13 13:49:35,745 INFO L294 olderBase$Statistics]: this new event has 308 ancestors and is not cut-off event [2024-11-13 13:49:35,745 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-13 13:49:35,745 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-13 13:49:35,745 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is not cut-off event [2024-11-13 13:49:35,745 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is not cut-off event [2024-11-13 13:49:35,772 INFO L124 PetriNetUnfolderBase]: 60/2025 cut-off events. [2024-11-13 13:49:35,772 INFO L125 PetriNetUnfolderBase]: For 13/62 co-relation queries the response was YES. [2024-11-13 13:49:35,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 2025 events. 60/2025 cut-off events. For 13/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10786 event pairs, 14 based on Foata normal form. 4/1859 useless extension candidates. Maximal degree in co-relation 2234. Up to 68 conditions per place. [2024-11-13 13:49:35,795 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2024-11-13 13:49:35,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 467 transitions, 1133 flow [2024-11-13 13:49:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:49:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:49:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-13 13:49:35,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-13 13:49:35,804 INFO L175 Difference]: Start difference. First operand has 425 places, 424 transitions, 875 flow. Second operand 10 states and 4633 transitions. [2024-11-13 13:49:35,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 467 transitions, 1133 flow [2024-11-13 13:49:35,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 467 transitions, 1133 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:49:35,812 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2024-11-13 13:49:35,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2024-11-13 13:49:35,814 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-11-13 13:49:35,814 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2024-11-13 13:49:35,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 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-13 13:49:35,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:35,816 INFO L204 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] [2024-11-13 13:49:35,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:49:35,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:35,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:35,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1240927977, now seen corresponding path program 1 times [2024-11-13 13:49:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017189705] [2024-11-13 13:49:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,889 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-13 13:49:35,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:35,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017189705] [2024-11-13 13:49:35,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017189705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:35,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:35,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:35,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489246355] [2024-11-13 13:49:35,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:35,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:35,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:35,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:35,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-13 13:49:35,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 449 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 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-13 13:49:35,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:35,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-13 13:49:35,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:36,376 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2024-11-13 13:49:36,377 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2024-11-13 13:49:36,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 2072 events. 102/2072 cut-off events. For 80/90 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11494 event pairs, 2 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2365. Up to 124 conditions per place. [2024-11-13 13:49:36,399 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2024-11-13 13:49:36,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2024-11-13 13:49:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2024-11-13 13:49:36,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395109395109396 [2024-11-13 13:49:36,403 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2024-11-13 13:49:36,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2024-11-13 13:49:36,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:49:36,413 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2024-11-13 13:49:36,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=439, PETRI_TRANSITIONS=448} [2024-11-13 13:49:36,414 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-11-13 13:49:36,415 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2024-11-13 13:49:36,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 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-13 13:49:36,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:36,416 INFO L204 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] [2024-11-13 13:49:36,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:49:36,416 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:36,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash -72457084, now seen corresponding path program 1 times [2024-11-13 13:49:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403101542] [2024-11-13 13:49:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,649 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-13 13:49:36,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:36,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403101542] [2024-11-13 13:49:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403101542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:36,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:49:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443646962] [2024-11-13 13:49:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:36,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:49:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:49:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:37,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-13 13:49:37,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 448 transitions, 1070 flow. Second operand has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 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-13 13:49:37,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:37,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-13 13:49:37,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:37,518 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2024-11-13 13:49:37,518 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2024-11-13 13:49:37,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1499 events. 73/1499 cut-off events. For 103/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7128 event pairs, 28 based on Foata normal form. 4/1395 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2024-11-13 13:49:37,534 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2024-11-13 13:49:37,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2024-11-13 13:49:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:49:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:49:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-13 13:49:37,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-13 13:49:37,544 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2024-11-13 13:49:37,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2024-11-13 13:49:37,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:49:37,558 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2024-11-13 13:49:37,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1175, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2024-11-13 13:49:37,561 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-13 13:49:37,561 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2024-11-13 13:49:37,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 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-13 13:49:37,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:37,563 INFO L204 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] [2024-11-13 13:49:37,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:49:37,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:37,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash -639936753, now seen corresponding path program 1 times [2024-11-13 13:49:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:37,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530687351] [2024-11-13 13:49:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,823 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-13 13:49:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:37,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530687351] [2024-11-13 13:49:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530687351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:37,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:37,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:49:37,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405471580] [2024-11-13 13:49:37,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:37,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:49:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:49:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:38,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-13 13:49:38,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 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-13 13:49:38,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:38,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-13 13:49:38,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:38,896 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2024-11-13 13:49:38,896 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2024-11-13 13:49:38,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1494 events. 72/1494 cut-off events. For 169/176 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6928 event pairs, 29 based on Foata normal form. 3/1401 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2024-11-13 13:49:38,907 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2024-11-13 13:49:38,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2024-11-13 13:49:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:49:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 13:49:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-13 13:49:38,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-13 13:49:38,916 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2024-11-13 13:49:38,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2024-11-13 13:49:38,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-13 13:49:38,927 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2024-11-13 13:49:38,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1207, PETRI_PLACES=454, PETRI_TRANSITIONS=452} [2024-11-13 13:49:38,928 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2024-11-13 13:49:38,928 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2024-11-13 13:49:38,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 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-13 13:49:38,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:38,931 INFO L204 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] [2024-11-13 13:49:38,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:49:38,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:38,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:38,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1619883910, now seen corresponding path program 1 times [2024-11-13 13:49:38,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:38,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47481071] [2024-11-13 13:49:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,996 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-13 13:49:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:38,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47481071] [2024-11-13 13:49:38,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47481071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:38,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:38,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141812757] [2024-11-13 13:49:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:38,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:39,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-13 13:49:39,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 452 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 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-13 13:49:39,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:39,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-13 13:49:39,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:39,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1351] L68-->L68-1: Formula: (= |v_#race~csum~0_4| 0) InVars {} OutVars{#race~csum~0=|v_#race~csum~0_4|} AuxVars[] AssignedVars[#race~csum~0][403], [560#(= |#race~C~0| 0), Black: 568#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 602#(= |#race~csum~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 301#L87true, 581#true, 562#true, 204#L68-1true]) [2024-11-13 13:49:39,267 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-11-13 13:49:39,267 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-11-13 13:49:39,268 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-11-13 13:49:39,268 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-11-13 13:49:39,287 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2024-11-13 13:49:39,287 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2024-11-13 13:49:39,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1185 events. 48/1185 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4420 event pairs, 3 based on Foata normal form. 6/1127 useless extension candidates. Maximal degree in co-relation 1423. Up to 37 conditions per place. [2024-11-13 13:49:39,298 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2024-11-13 13:49:39,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2024-11-13 13:49:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-11-13 13:49:39,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-11-13 13:49:39,301 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2024-11-13 13:49:39,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2024-11-13 13:49:39,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-13 13:49:39,310 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2024-11-13 13:49:39,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=447, PETRI_TRANSITIONS=422} [2024-11-13 13:49:39,312 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-11-13 13:49:39,312 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2024-11-13 13:49:39,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 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-13 13:49:39,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:39,313 INFO L204 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] [2024-11-13 13:49:39,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:49:39,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:39,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1732434000, now seen corresponding path program 1 times [2024-11-13 13:49:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:39,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820245962] [2024-11-13 13:49:39,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:49:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820245962] [2024-11-13 13:49:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820245962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:40,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:40,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:49:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555893855] [2024-11-13 13:49:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:40,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:40,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:40,678 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-13 13:49:40,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 422 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 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-13 13:49:40,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:40,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-13 13:49:40,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:41,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 567#(<= ~N~0 0), 262#L67-27true, 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0)), 528#(= |#race~A~0| 0), 301#L87true, Black: 533#true, 562#true]) [2024-11-13 13:49:41,217 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2024-11-13 13:49:41,217 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-13 13:49:41,217 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-13 13:49:41,217 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-13 13:49:41,505 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 567#(<= ~N~0 0), 262#L67-27true, 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 542#(<= ~N~0 0), Black: 526#true, Black: 558#true, 603#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), Black: 533#true, 528#(= |#race~A~0| 0), 301#L87true, 562#true]) [2024-11-13 13:49:41,505 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-13 13:49:41,505 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-13 13:49:41,505 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-11-13 13:49:41,505 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-13 13:49:41,505 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-13 13:49:41,519 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2024-11-13 13:49:41,519 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2024-11-13 13:49:41,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 3554 events. 203/3554 cut-off events. For 56/77 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 25976 event pairs, 44 based on Foata normal form. 4/3276 useless extension candidates. Maximal degree in co-relation 4196. Up to 292 conditions per place. [2024-11-13 13:49:41,554 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2024-11-13 13:49:41,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2024-11-13 13:49:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:49:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-11-13 13:49:41,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-11-13 13:49:41,560 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2024-11-13 13:49:41,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2024-11-13 13:49:41,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2024-11-13 13:49:41,571 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2024-11-13 13:49:41,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=443} [2024-11-13 13:49:41,572 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-11-13 13:49:41,572 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2024-11-13 13:49:41,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 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-13 13:49:41,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:41,574 INFO L204 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] [2024-11-13 13:49:41,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:49:41,574 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:41,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash -344770743, now seen corresponding path program 1 times [2024-11-13 13:49:41,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:41,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46364439] [2024-11-13 13:49:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:49:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46364439] [2024-11-13 13:49:42,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46364439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:42,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:42,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:49:42,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259868376] [2024-11-13 13:49:42,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:42,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:42,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-13 13:49:42,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 443 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 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-13 13:49:42,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:42,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-13 13:49:42,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:44,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][288], [326#L86-1true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 3#L67-11true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 392#L59-3true]) [2024-11-13 13:49:44,837 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-13 13:49:44,837 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-13 13:49:44,837 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-13 13:49:44,837 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-13 13:49:45,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][371], [326#L86-1true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 262#L67-27true, 535#(= |#race~B~0| 0), 349#L62true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 526#true, Black: 558#true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true]) [2024-11-13 13:49:45,543 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-11-13 13:49:45,543 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-13 13:49:45,543 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-13 13:49:45,543 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-13 13:49:45,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 262#L67-27true, 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 603#true, 507#(= |#race~N~0| 0), 301#L87true, 528#(= |#race~A~0| 0), Black: 533#true]) [2024-11-13 13:49:45,576 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-13 13:49:45,576 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-13 13:49:45,576 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-13 13:49:45,576 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-13 13:49:45,716 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2024-11-13 13:49:45,716 INFO L125 PetriNetUnfolderBase]: For 1657/1739 co-relation queries the response was YES. [2024-11-13 13:49:45,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1657/1739 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 172140 event pairs, 205 based on Foata normal form. 0/13463 useless extension candidates. Maximal degree in co-relation 18855. Up to 1392 conditions per place. [2024-11-13 13:49:45,792 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2024-11-13 13:49:45,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2024-11-13 13:49:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:49:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-11-13 13:49:45,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-11-13 13:49:45,796 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2024-11-13 13:49:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2024-11-13 13:49:45,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:49:45,818 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2024-11-13 13:49:45,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1903, PETRI_PLACES=444, PETRI_TRANSITIONS=528} [2024-11-13 13:49:45,819 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2024-11-13 13:49:45,819 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2024-11-13 13:49:45,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 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-13 13:49:45,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:45,823 INFO L204 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] [2024-11-13 13:49:45,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:49:45,823 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:45,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2019967508, now seen corresponding path program 1 times [2024-11-13 13:49:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:45,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515556884] [2024-11-13 13:49:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:49:46,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:46,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515556884] [2024-11-13 13:49:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515556884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:46,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:49:46,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376205333] [2024-11-13 13:49:46,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:46,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:46,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:46,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:47,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-13 13:49:47,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 528 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 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-13 13:49:47,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:47,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-13 13:49:47,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:49,535 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2024-11-13 13:49:49,535 INFO L125 PetriNetUnfolderBase]: For 3743/3853 co-relation queries the response was YES. [2024-11-13 13:49:49,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 12311 events. 1151/12311 cut-off events. For 3743/3853 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 136638 event pairs, 132 based on Foata normal form. 0/11312 useless extension candidates. Maximal degree in co-relation 17418. Up to 1063 conditions per place. [2024-11-13 13:49:49,671 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2024-11-13 13:49:49,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2024-11-13 13:49:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:49:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-11-13 13:49:49,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-11-13 13:49:49,678 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2024-11-13 13:49:49,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2024-11-13 13:49:49,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:49:49,700 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2024-11-13 13:49:49,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1959, PETRI_PLACES=448, PETRI_TRANSITIONS=527} [2024-11-13 13:49:49,701 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2024-11-13 13:49:49,702 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2024-11-13 13:49:49,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 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-13 13:49:49,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:49,703 INFO L204 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] [2024-11-13 13:49:49,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:49:49,703 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:49,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:49,704 INFO L85 PathProgramCache]: Analyzing trace with hash -464366534, now seen corresponding path program 1 times [2024-11-13 13:49:49,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:49,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78947995] [2024-11-13 13:49:49,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:49,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:49:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78947995] [2024-11-13 13:49:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78947995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:50,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:49:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539594120] [2024-11-13 13:49:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:50,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:50,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:51,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-13 13:49:51,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 527 transitions, 1959 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 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-13 13:49:51,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:51,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-13 13:49:51,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:53,540 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2024-11-13 13:49:53,540 INFO L125 PetriNetUnfolderBase]: For 4434/4544 co-relation queries the response was YES. [2024-11-13 13:49:53,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 12228 events. 1146/12228 cut-off events. For 4434/4544 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 135326 event pairs, 132 based on Foata normal form. 0/11296 useless extension candidates. Maximal degree in co-relation 17812. Up to 1063 conditions per place. [2024-11-13 13:49:53,651 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2024-11-13 13:49:53,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2024-11-13 13:49:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:49:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-11-13 13:49:53,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-11-13 13:49:53,655 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2024-11-13 13:49:53,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2024-11-13 13:49:53,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 13:49:53,862 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2024-11-13 13:49:53,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1957, PETRI_PLACES=447, PETRI_TRANSITIONS=526} [2024-11-13 13:49:53,863 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-11-13 13:49:53,863 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2024-11-13 13:49:53,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 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-13 13:49:53,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:53,864 INFO L204 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] [2024-11-13 13:49:53,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:49:53,864 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:53,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash 874150016, now seen corresponding path program 1 times [2024-11-13 13:49:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:53,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163536101] [2024-11-13 13:49:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:49:53,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:53,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163536101] [2024-11-13 13:49:53,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163536101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:53,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:53,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457245052] [2024-11-13 13:49:53,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:53,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:53,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:53,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-13 13:49:53,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 526 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 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-13 13:49:53,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:53,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-13 13:49:53,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:56,414 INFO L124 PetriNetUnfolderBase]: 884/10875 cut-off events. [2024-11-13 13:49:56,415 INFO L125 PetriNetUnfolderBase]: For 2301/2409 co-relation queries the response was YES. [2024-11-13 13:49:56,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14887 conditions, 10875 events. 884/10875 cut-off events. For 2301/2409 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 115930 event pairs, 71 based on Foata normal form. 1/10088 useless extension candidates. Maximal degree in co-relation 14842. Up to 727 conditions per place. [2024-11-13 13:49:56,539 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2024-11-13 13:49:56,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2024-11-13 13:49:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-11-13 13:49:56,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-11-13 13:49:56,543 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2024-11-13 13:49:56,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2024-11-13 13:49:56,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-13 13:49:56,562 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2024-11-13 13:49:56,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=443, PETRI_TRANSITIONS=525} [2024-11-13 13:49:56,564 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2024-11-13 13:49:56,564 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2024-11-13 13:49:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 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-13 13:49:56,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:56,565 INFO L204 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] [2024-11-13 13:49:56,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:49:56,565 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:56,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash -867347111, now seen corresponding path program 1 times [2024-11-13 13:49:56,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:56,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209507069] [2024-11-13 13:49:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:49:56,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:56,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209507069] [2024-11-13 13:49:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209507069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:56,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117353] [2024-11-13 13:49:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:56,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-13 13:49:56,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 525 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 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-13 13:49:56,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:49:56,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-13 13:49:56,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:49:59,464 INFO L124 PetriNetUnfolderBase]: 1055/13325 cut-off events. [2024-11-13 13:49:59,464 INFO L125 PetriNetUnfolderBase]: For 2011/2147 co-relation queries the response was YES. [2024-11-13 13:49:59,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17599 conditions, 13325 events. 1055/13325 cut-off events. For 2011/2147 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 150077 event pairs, 101 based on Foata normal form. 0/12389 useless extension candidates. Maximal degree in co-relation 17554. Up to 858 conditions per place. [2024-11-13 13:49:59,619 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2024-11-13 13:49:59,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2024-11-13 13:49:59,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:49:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-11-13 13:49:59,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-11-13 13:49:59,623 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2024-11-13 13:49:59,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2024-11-13 13:49:59,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:49:59,643 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2024-11-13 13:49:59,644 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=442, PETRI_TRANSITIONS=524} [2024-11-13 13:49:59,644 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2024-11-13 13:49:59,644 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2024-11-13 13:49:59,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 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-13 13:49:59,645 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:49:59,645 INFO L204 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] [2024-11-13 13:49:59,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 13:49:59,646 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:49:59,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash 917221078, now seen corresponding path program 1 times [2024-11-13 13:49:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423348968] [2024-11-13 13:49:59,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:50:00,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:50:00,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423348968] [2024-11-13 13:50:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423348968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:00,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:50:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158813623] [2024-11-13 13:50:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:00,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:50:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:50:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:50:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:50:01,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 518 [2024-11-13 13:50:01,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 524 transitions, 1899 flow. Second operand has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 0 states have call successors, (0), 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-13 13:50:01,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:50:01,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 518 [2024-11-13 13:50:01,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:50:07,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][535], [560#(= |#race~C~0| 0), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 418#L85-4true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 262#L67-27true, 535#(= |#race~B~0| 0), 640#true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 125#L59-10true, Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 526#true, Black: 558#true, 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 603#true, 199#L51-10true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true]) [2024-11-13 13:50:07,176 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2024-11-13 13:50:07,176 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-13 13:50:07,177 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-13 13:50:07,177 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-13 13:50:07,361 INFO L124 PetriNetUnfolderBase]: 6087/33187 cut-off events. [2024-11-13 13:50:07,361 INFO L125 PetriNetUnfolderBase]: For 11989/12104 co-relation queries the response was YES. [2024-11-13 13:50:07,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55262 conditions, 33187 events. 6087/33187 cut-off events. For 11989/12104 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 407383 event pairs, 2256 based on Foata normal form. 0/31177 useless extension candidates. Maximal degree in co-relation 55216. Up to 8927 conditions per place. [2024-11-13 13:50:07,893 INFO L140 encePairwiseOnDemand]: 503/518 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2024-11-13 13:50:07,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2024-11-13 13:50:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:50:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:50:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2024-11-13 13:50:07,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8844916344916345 [2024-11-13 13:50:07,897 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2024-11-13 13:50:07,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2024-11-13 13:50:07,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:50:07,964 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2024-11-13 13:50:07,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2541, PETRI_PLACES=450, PETRI_TRANSITIONS=576} [2024-11-13 13:50:07,965 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-13 13:50:07,965 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2024-11-13 13:50:07,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 0 states have call successors, (0), 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-13 13:50:07,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:50:07,965 INFO L204 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] [2024-11-13 13:50:07,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 13:50:07,966 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:50:07,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1447184073, now seen corresponding path program 1 times [2024-11-13 13:50:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:50:07,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276160197] [2024-11-13 13:50:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:50:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:50:09,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:50:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276160197] [2024-11-13 13:50:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276160197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-13 13:50:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280213636] [2024-11-13 13:50:09,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:50:09,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:50:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:50:09,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:50:14,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-11-13 13:50:14,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 576 transitions, 2541 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 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-13 13:50:14,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:50:14,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-11-13 13:50:14,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:50:23,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1408] thread2EXIT-->L87: 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[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, 180#L67-10true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 301#L87true]) [2024-11-13 13:50:23,344 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-13 13:50:23,344 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-13 13:50:23,344 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-13 13:50:23,345 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-13 13:50:24,426 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1408] thread2EXIT-->L87: 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[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, 180#L67-10true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 301#L87true]) [2024-11-13 13:50:24,426 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-13 13:50:24,426 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-13 13:50:24,426 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-13 13:50:24,426 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-13 13:50:24,426 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-13 13:50:27,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 418#L85-4true, 262#L67-27true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 643#true, 105#L54true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 125#L59-10true, Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:27,557 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-13 13:50:27,557 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-13 13:50:27,557 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-13 13:50:27,557 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-13 13:50:27,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1303] L67-10-->L67-11: Formula: (= |v_#race~B~0_4| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_4|} AuxVars[] AssignedVars[#race~B~0][287], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, 392#L59-3true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 3#L67-11true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 74#L50-7true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:27,658 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-11-13 13:50:27,658 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-13 13:50:27,658 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-13 13:50:27,658 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2024-11-13 13:50:27,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 262#L67-27true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, 326#L86-1true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), 125#L59-10true, Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:27,920 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-11-13 13:50:27,920 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-11-13 13:50:27,921 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-13 13:50:27,921 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-13 13:50:30,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1343] L67-28-->L67-29: Formula: (= (store |v_#race_46| v_~C~0.base_4 (store (select |v_#race_46| v_~C~0.base_4) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_43| 4) 2 v_~C~0.offset_4) |v_thread3Thread1of1ForFork1_#t~nondet12#1_7|)) |v_#race_45|) InVars {#race=|v_#race_46|, ~C~0.offset=v_~C~0.offset_4, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_7|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_43|, ~C~0.base=v_~C~0.base_4} OutVars{#race=|v_#race_45|, ~C~0.offset=v_~C~0.offset_4, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_7|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_43|, ~C~0.base=v_~C~0.base_4} AuxVars[] AssignedVars[#race][578], [560#(= |#race~C~0| 0), 418#L85-4true, 359#L58-7true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), 311#L67-29true, Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 199#L51-10true, 528#(= |#race~A~0| 0), 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2024-11-13 13:50:30,643 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2024-11-13 13:50:30,644 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-13 13:50:30,644 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-13 13:50:30,644 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-13 13:50:30,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1344] L67-29-->L67-30: Formula: (= |v_#race_47| (store |v_#race_48| v_~C~0.base_5 (store (select |v_#race_48| v_~C~0.base_5) (+ 3 (* |v_thread3Thread1of1ForFork1_~i~2#1_45| 4) v_~C~0.offset_5) |v_thread3Thread1of1ForFork1_#t~nondet12#1_9|))) InVars {#race=|v_#race_48|, ~C~0.offset=v_~C~0.offset_5, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_9|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_45|, ~C~0.base=v_~C~0.base_5} OutVars{#race=|v_#race_47|, ~C~0.offset=v_~C~0.offset_5, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_9|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_45|, ~C~0.base=v_~C~0.base_5} AuxVars[] AssignedVars[#race][596], [560#(= |#race~C~0| 0), 319#L67-30true, 418#L85-4true, 359#L58-7true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 199#L51-10true, 528#(= |#race~A~0| 0), 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2024-11-13 13:50:30,693 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-11-13 13:50:30,693 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-13 13:50:30,693 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-13 13:50:30,693 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-13 13:50:30,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][405], [560#(= |#race~C~0| 0), 418#L85-4true, 262#L67-27true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 643#true, 105#L54true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 484#L59-8true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:30,713 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-11-13 13:50:30,713 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-13 13:50:30,713 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-13 13:50:30,713 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-13 13:50:30,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][405], [560#(= |#race~C~0| 0), 262#L67-27true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, 326#L86-1true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 484#L59-8true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:30,713 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2024-11-13 13:50:30,713 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-13 13:50:30,713 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-13 13:50:30,713 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2024-11-13 13:50:30,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 262#L67-27true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, 326#L86-1true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 136#L59-9true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:30,757 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2024-11-13 13:50:30,757 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-13 13:50:30,757 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-13 13:50:30,757 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-13 13:50:30,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1341] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork1_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork1_#t~nondet12#1=|v_thread3Thread1of1ForFork1_#t~nondet12#1_3|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_39|, ~C~0.base=v_~C~0.base_2} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 418#L85-4true, 262#L67-27true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 105#L54true, Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 136#L59-9true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:30,757 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2024-11-13 13:50:30,757 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-13 13:50:30,757 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-13 13:50:30,757 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-13 13:50:31,054 INFO L124 PetriNetUnfolderBase]: 8434/64624 cut-off events. [2024-11-13 13:50:31,054 INFO L125 PetriNetUnfolderBase]: For 49248/54923 co-relation queries the response was YES. [2024-11-13 13:50:31,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109651 conditions, 64624 events. 8434/64624 cut-off events. For 49248/54923 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 931061 event pairs, 1041 based on Foata normal form. 501/61132 useless extension candidates. Maximal degree in co-relation 109598. Up to 4505 conditions per place. [2024-11-13 13:50:31,952 INFO L140 encePairwiseOnDemand]: 483/518 looper letters, 493 selfloop transitions, 44 changer transitions 0/939 dead transitions. [2024-11-13 13:50:31,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 939 transitions, 7205 flow [2024-11-13 13:50:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 13:50:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-13 13:50:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13770 transitions. [2024-11-13 13:50:31,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.830719111969112 [2024-11-13 13:50:31,964 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 32 states and 13770 transitions. [2024-11-13 13:50:31,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 939 transitions, 7205 flow [2024-11-13 13:50:32,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 939 transitions, 7169 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-13 13:50:32,254 INFO L231 Difference]: Finished difference. Result has 485 places, 593 transitions, 2700 flow [2024-11-13 13:50:32,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2700, PETRI_PLACES=485, PETRI_TRANSITIONS=593} [2024-11-13 13:50:32,255 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, 30 predicate places. [2024-11-13 13:50:32,256 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 593 transitions, 2700 flow [2024-11-13 13:50:32,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 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-13 13:50:32,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:50:32,259 INFO L204 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] [2024-11-13 13:50:32,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 13:50:32,259 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-13 13:50:32,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:32,259 INFO L85 PathProgramCache]: Analyzing trace with hash 319116541, now seen corresponding path program 2 times [2024-11-13 13:50:32,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:50:32,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058276759] [2024-11-13 13:50:32,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:32,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:50:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:50:34,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:50:34,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058276759] [2024-11-13 13:50:34,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058276759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:34,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:34,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-13 13:50:34,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64193680] [2024-11-13 13:50:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:34,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 13:50:34,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:50:34,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 13:50:34,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:50:40,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-11-13 13:50:40,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 593 transitions, 2700 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 0 states have call successors, (0), 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-13 13:50:40,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:50:40,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-11-13 13:50:40,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:50:44,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][293], [560#(= |#race~C~0| 0), 418#L85-4true, Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 643#true, 105#L54true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 723#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (= (select |#valid| ~A~0.base) 1)), 799#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (= (select |#valid| ~A~0.base) 1)), Black: 533#true, Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 392#L59-3true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 3#L67-11true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:44,673 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2024-11-13 13:50:44,673 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-11-13 13:50:44,673 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-13 13:50:44,673 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-13 13:50:45,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1232] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][293], [560#(= |#race~C~0| 0), Black: 648#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), Black: 645#(= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))), Black: 647#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|))))), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (= |thread3Thread1of1ForFork1_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ ~C~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 723#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (= (select |#valid| ~A~0.base) 1)), 799#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= |thread3Thread1of1ForFork1_~i~2#1| 0) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 392#L59-3true, 326#L86-1true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 3#L67-11true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-13 13:50:45,748 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is cut-off event [2024-11-13 13:50:45,748 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-13 13:50:45,748 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-13 13:50:45,748 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event