./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:53,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:53,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:29:53,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:53,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:53,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:53,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:53,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:53,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:53,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:53,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:53,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:53,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:53,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:53,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:53,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:53,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:53,231 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-01-09 21:29:53,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:53,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:53,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:53,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:53,445 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:53,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-01-09 21:29:54,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81853b968/cc45fa3a99aa4ffdbcc3b453bff5f7bb/FLAG45572d6c9 [2025-01-09 21:29:54,908 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:54,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-01-09 21:29:54,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81853b968/cc45fa3a99aa4ffdbcc3b453bff5f7bb/FLAG45572d6c9 [2025-01-09 21:29:54,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81853b968/cc45fa3a99aa4ffdbcc3b453bff5f7bb [2025-01-09 21:29:54,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:54,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:54,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:54,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:54,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:54,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:54" (1/1) ... [2025-01-09 21:29:54,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5170f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:54, skipping insertion in model container [2025-01-09 21:29:54,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:54" (1/1) ... [2025-01-09 21:29:54,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:55,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:55,094 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:55,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:55,134 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:55,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55 WrapperNode [2025-01-09 21:29:55,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:55,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:55,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:55,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:55,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,179 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 476 [2025-01-09 21:29:55,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:55,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:55,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:55,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:55,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:55,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:55,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:55,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:55,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (1/1) ... [2025-01-09 21:29:55,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:55,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:55,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:29:55,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:29:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:29:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:29:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:29:55,259 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:29:55,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:55,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:55,874 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:55,874 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:55,893 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:55,893 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:29:55,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:55 BoogieIcfgContainer [2025-01-09 21:29:55,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:55,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:55,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:55,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:55,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:54" (1/3) ... [2025-01-09 21:29:55,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e97d757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:55, skipping insertion in model container [2025-01-09 21:29:55,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:55" (2/3) ... [2025-01-09 21:29:55,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e97d757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:55, skipping insertion in model container [2025-01-09 21:29:55,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:55" (3/3) ... [2025-01-09 21:29:55,900 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-01-09 21:29:55,910 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:55,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 599 locations, 1 initial locations, 6 loop locations, and 59 error locations. [2025-01-09 21:29:55,912 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:56,085 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:29:56,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 608 places, 628 transitions, 1277 flow [2025-01-09 21:29:56,312 INFO L124 PetriNetUnfolderBase]: 30/625 cut-off events. [2025-01-09 21:29:56,314 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:29:56,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 625 events. 30/625 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1512 event pairs, 0 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 464. Up to 3 conditions per place. [2025-01-09 21:29:56,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 608 places, 628 transitions, 1277 flow [2025-01-09 21:29:56,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 605 transitions, 1228 flow [2025-01-09 21:29:56,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:56,350 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;@7d5a64cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:56,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-01-09 21:29:56,358 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:56,358 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:29:56,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:56,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:56,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:56,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:29:56,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:56,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1149413839, now seen corresponding path program 1 times [2025-01-09 21:29:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:56,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985270061] [2025-01-09 21:29:56,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:56,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:56,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:29:56,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:29:56,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:56,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:56,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:56,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985270061] [2025-01-09 21:29:56,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985270061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:56,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:56,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:56,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422555459] [2025-01-09 21:29:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:56,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:56,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:56,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:56,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:56,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-01-09 21:29:56,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 605 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:56,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:56,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-01-09 21:29:56,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:56,871 INFO L124 PetriNetUnfolderBase]: 56/1488 cut-off events. [2025-01-09 21:29:56,872 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:29:56,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1488 events. 56/1488 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8297 event pairs, 20 based on Foata normal form. 39/1287 useless extension candidates. Maximal degree in co-relation 1200. Up to 51 conditions per place. [2025-01-09 21:29:56,895 INFO L140 encePairwiseOnDemand]: 609/628 looper letters, 14 selfloop transitions, 2 changer transitions 7/588 dead transitions. [2025-01-09 21:29:56,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 588 transitions, 1226 flow [2025-01-09 21:29:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2025-01-09 21:29:56,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601910828025477 [2025-01-09 21:29:56,916 INFO L175 Difference]: Start difference. First operand has 587 places, 605 transitions, 1228 flow. Second operand 3 states and 1809 transitions. [2025-01-09 21:29:56,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 588 transitions, 1226 flow [2025-01-09 21:29:56,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 588 transitions, 1214 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:29:56,934 INFO L231 Difference]: Finished difference. Result has 582 places, 581 transitions, 1172 flow [2025-01-09 21:29:56,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=582, PETRI_TRANSITIONS=581} [2025-01-09 21:29:56,941 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -5 predicate places. [2025-01-09 21:29:56,942 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 581 transitions, 1172 flow [2025-01-09 21:29:56,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:56,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:56,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:56,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:56,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:29:56,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1376445912, now seen corresponding path program 1 times [2025-01-09 21:29:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:56,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520527890] [2025-01-09 21:29:56,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:56,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:56,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:29:56,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:29:56,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:56,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:56,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520527890] [2025-01-09 21:29:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520527890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423187087] [2025-01-09 21:29:56,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:56,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:56,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:56,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:57,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-01-09 21:29:57,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 581 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:57,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:57,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-01-09 21:29:57,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:57,216 INFO L124 PetriNetUnfolderBase]: 36/1024 cut-off events. [2025-01-09 21:29:57,216 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:29:57,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 1024 events. 36/1024 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4583 event pairs, 12 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1042. Up to 39 conditions per place. [2025-01-09 21:29:57,231 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2025-01-09 21:29:57,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1202 flow [2025-01-09 21:29:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2025-01-09 21:29:57,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516985138004246 [2025-01-09 21:29:57,235 INFO L175 Difference]: Start difference. First operand has 582 places, 581 transitions, 1172 flow. Second operand 3 states and 1793 transitions. [2025-01-09 21:29:57,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1202 flow [2025-01-09 21:29:57,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:57,244 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1170 flow [2025-01-09 21:29:57,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=574, PETRI_TRANSITIONS=580} [2025-01-09 21:29:57,245 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -13 predicate places. [2025-01-09 21:29:57,245 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1170 flow [2025-01-09 21:29:57,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:57,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:57,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:57,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:57,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:29:57,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -215745729, now seen corresponding path program 1 times [2025-01-09 21:29:57,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:57,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232975115] [2025-01-09 21:29:57,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:57,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:29:57,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:29:57,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:57,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232975115] [2025-01-09 21:29:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232975115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057673610] [2025-01-09 21:29:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:57,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:57,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:57,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:57,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-01-09 21:29:57,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:57,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:57,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-01-09 21:29:57,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:57,485 INFO L124 PetriNetUnfolderBase]: 56/1455 cut-off events. [2025-01-09 21:29:57,485 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2025-01-09 21:29:57,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1455 events. 56/1455 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7775 event pairs, 20 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 1475. Up to 51 conditions per place. [2025-01-09 21:29:57,503 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2025-01-09 21:29:57,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 579 transitions, 1200 flow [2025-01-09 21:29:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2025-01-09 21:29:57,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516985138004246 [2025-01-09 21:29:57,506 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1170 flow. Second operand 3 states and 1793 transitions. [2025-01-09 21:29:57,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 579 transitions, 1200 flow [2025-01-09 21:29:57,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:57,512 INFO L231 Difference]: Finished difference. Result has 573 places, 579 transitions, 1168 flow [2025-01-09 21:29:57,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=573, PETRI_TRANSITIONS=579} [2025-01-09 21:29:57,513 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -14 predicate places. [2025-01-09 21:29:57,513 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 579 transitions, 1168 flow [2025-01-09 21:29:57,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:57,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:57,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:57,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:57,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:29:57,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2140409753, now seen corresponding path program 1 times [2025-01-09 21:29:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:57,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82948831] [2025-01-09 21:29:57,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:57,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:29:57,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:29:57,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:57,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82948831] [2025-01-09 21:29:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82948831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988555257] [2025-01-09 21:29:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:57,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:57,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:57,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:57,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-01-09 21:29:57,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 579 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:57,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:57,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-01-09 21:29:57,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:57,878 INFO L124 PetriNetUnfolderBase]: 132/2496 cut-off events. [2025-01-09 21:29:57,878 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:29:57,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 2496 events. 132/2496 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18587 event pairs, 64 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 2621. Up to 138 conditions per place. [2025-01-09 21:29:57,909 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2025-01-09 21:29:57,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1192 flow [2025-01-09 21:29:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-01-09 21:29:57,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-01-09 21:29:57,912 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1168 flow. Second operand 3 states and 1786 transitions. [2025-01-09 21:29:57,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1192 flow [2025-01-09 21:29:57,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:57,919 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1156 flow [2025-01-09 21:29:57,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=568, PETRI_TRANSITIONS=574} [2025-01-09 21:29:57,921 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2025-01-09 21:29:57,921 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1156 flow [2025-01-09 21:29:57,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:57,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:57,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:57,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:57,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:29:57,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2075483606, now seen corresponding path program 1 times [2025-01-09 21:29:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:57,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238881320] [2025-01-09 21:29:57,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:57,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:29:57,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:29:57,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:57,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:58,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238881320] [2025-01-09 21:29:58,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238881320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229927986] [2025-01-09 21:29:58,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-01-09 21:29:58,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 574 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:58,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-01-09 21:29:58,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,271 INFO L124 PetriNetUnfolderBase]: 62/1747 cut-off events. [2025-01-09 21:29:58,271 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-01-09 21:29:58,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 1747 events. 62/1747 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9850 event pairs, 20 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1765. Up to 50 conditions per place. [2025-01-09 21:29:58,290 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2025-01-09 21:29:58,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 573 transitions, 1184 flow [2025-01-09 21:29:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-01-09 21:29:58,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-01-09 21:29:58,293 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1156 flow. Second operand 3 states and 1795 transitions. [2025-01-09 21:29:58,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 573 transitions, 1184 flow [2025-01-09 21:29:58,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 573 transitions, 1183 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:58,299 INFO L231 Difference]: Finished difference. Result has 568 places, 573 transitions, 1157 flow [2025-01-09 21:29:58,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1157, PETRI_PLACES=568, PETRI_TRANSITIONS=573} [2025-01-09 21:29:58,300 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2025-01-09 21:29:58,301 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 573 transitions, 1157 flow [2025-01-09 21:29:58,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:58,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:58,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:58,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:29:58,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1207151249, now seen corresponding path program 1 times [2025-01-09 21:29:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068484672] [2025-01-09 21:29:58,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:29:58,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:29:58,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068484672] [2025-01-09 21:29:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068484672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634004233] [2025-01-09 21:29:58,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:58,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:59,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 628 [2025-01-09 21:29:59,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 573 transitions, 1157 flow. Second operand has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:29:59,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:59,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 628 [2025-01-09 21:29:59,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:05,447 INFO L124 PetriNetUnfolderBase]: 12107/56175 cut-off events. [2025-01-09 21:30:05,448 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-01-09 21:30:05,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73658 conditions, 56175 events. 12107/56175 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 784795 event pairs, 10080 based on Foata normal form. 0/48921 useless extension candidates. Maximal degree in co-relation 73609. Up to 17156 conditions per place. [2025-01-09 21:30:05,787 INFO L140 encePairwiseOnDemand]: 610/628 looper letters, 78 selfloop transitions, 15 changer transitions 0/570 dead transitions. [2025-01-09 21:30:05,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 570 transitions, 1337 flow [2025-01-09 21:30:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3180 transitions. [2025-01-09 21:30:05,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8439490445859873 [2025-01-09 21:30:05,793 INFO L175 Difference]: Start difference. First operand has 568 places, 573 transitions, 1157 flow. Second operand 6 states and 3180 transitions. [2025-01-09 21:30:05,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 570 transitions, 1337 flow [2025-01-09 21:30:05,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 570 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:05,799 INFO L231 Difference]: Finished difference. Result has 568 places, 570 transitions, 1177 flow [2025-01-09 21:30:05,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1177, PETRI_PLACES=568, PETRI_TRANSITIONS=570} [2025-01-09 21:30:05,801 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2025-01-09 21:30:05,802 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 570 transitions, 1177 flow [2025-01-09 21:30:05,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:05,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:05,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:05,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:05,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:05,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:05,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1049068289, now seen corresponding path program 1 times [2025-01-09 21:30:05,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:05,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986125295] [2025-01-09 21:30:05,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:05,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:05,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:30:05,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:30:05,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:05,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986125295] [2025-01-09 21:30:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986125295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:05,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:05,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:05,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109640763] [2025-01-09 21:30:05,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:05,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:05,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:05,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:05,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:05,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-01-09 21:30:05,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 570 transitions, 1177 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:05,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:05,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-01-09 21:30:05,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:06,139 INFO L124 PetriNetUnfolderBase]: 78/1635 cut-off events. [2025-01-09 21:30:06,139 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:30:06,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1635 events. 78/1635 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9893 event pairs, 32 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 1705. Up to 87 conditions per place. [2025-01-09 21:30:06,156 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2025-01-09 21:30:06,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 565 transitions, 1201 flow [2025-01-09 21:30:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-01-09 21:30:06,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-01-09 21:30:06,159 INFO L175 Difference]: Start difference. First operand has 568 places, 570 transitions, 1177 flow. Second operand 3 states and 1786 transitions. [2025-01-09 21:30:06,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 565 transitions, 1201 flow [2025-01-09 21:30:06,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 565 transitions, 1171 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:06,166 INFO L231 Difference]: Finished difference. Result has 560 places, 565 transitions, 1139 flow [2025-01-09 21:30:06,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=560, PETRI_TRANSITIONS=565} [2025-01-09 21:30:06,168 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2025-01-09 21:30:06,168 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 565 transitions, 1139 flow [2025-01-09 21:30:06,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:06,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:06,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:06,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:06,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash 227586194, now seen corresponding path program 1 times [2025-01-09 21:30:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709495225] [2025-01-09 21:30:06,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:06,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:30:06,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:30:06,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:06,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709495225] [2025-01-09 21:30:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709495225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:06,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499025699] [2025-01-09 21:30:06,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:06,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:06,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:06,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:06,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:06,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-01-09 21:30:06,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 565 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:06,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-01-09 21:30:06,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:06,344 INFO L124 PetriNetUnfolderBase]: 36/1038 cut-off events. [2025-01-09 21:30:06,345 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-01-09 21:30:06,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 1038 events. 36/1038 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4405 event pairs, 12 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2025-01-09 21:30:06,355 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-01-09 21:30:06,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 564 transitions, 1167 flow [2025-01-09 21:30:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-01-09 21:30:06,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-01-09 21:30:06,358 INFO L175 Difference]: Start difference. First operand has 560 places, 565 transitions, 1139 flow. Second operand 3 states and 1795 transitions. [2025-01-09 21:30:06,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 564 transitions, 1167 flow [2025-01-09 21:30:06,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 564 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:06,364 INFO L231 Difference]: Finished difference. Result has 560 places, 564 transitions, 1140 flow [2025-01-09 21:30:06,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=560, PETRI_TRANSITIONS=564} [2025-01-09 21:30:06,367 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2025-01-09 21:30:06,367 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 564 transitions, 1140 flow [2025-01-09 21:30:06,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:06,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:06,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:06,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2142762839, now seen corresponding path program 1 times [2025-01-09 21:30:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936704267] [2025-01-09 21:30:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:06,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:30:06,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:30:06,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:06,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936704267] [2025-01-09 21:30:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936704267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:06,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:06,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893105143] [2025-01-09 21:30:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:06,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:06,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:06,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:06,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:06,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-01-09 21:30:06,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 564 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:06,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-01-09 21:30:06,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:06,671 INFO L124 PetriNetUnfolderBase]: 136/2442 cut-off events. [2025-01-09 21:30:06,672 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2025-01-09 21:30:06,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 2442 events. 136/2442 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17728 event pairs, 64 based on Foata normal form. 0/2112 useless extension candidates. Maximal degree in co-relation 2548. Up to 141 conditions per place. [2025-01-09 21:30:06,702 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2025-01-09 21:30:06,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 559 transitions, 1164 flow [2025-01-09 21:30:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-01-09 21:30:06,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-01-09 21:30:06,705 INFO L175 Difference]: Start difference. First operand has 560 places, 564 transitions, 1140 flow. Second operand 3 states and 1786 transitions. [2025-01-09 21:30:06,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 559 transitions, 1164 flow [2025-01-09 21:30:06,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 559 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:06,711 INFO L231 Difference]: Finished difference. Result has 555 places, 559 transitions, 1128 flow [2025-01-09 21:30:06,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=555, PETRI_TRANSITIONS=559} [2025-01-09 21:30:06,713 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-01-09 21:30:06,713 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 559 transitions, 1128 flow [2025-01-09 21:30:06,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:06,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:06,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:06,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:06,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash -627990404, now seen corresponding path program 1 times [2025-01-09 21:30:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:06,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983958810] [2025-01-09 21:30:06,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:06,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:30:06,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:30:06,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:06,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983958810] [2025-01-09 21:30:06,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983958810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:06,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:06,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626834008] [2025-01-09 21:30:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:06,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:06,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:06,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:06,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-01-09 21:30:06,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 559 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:06,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-01-09 21:30:06,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:06,867 INFO L124 PetriNetUnfolderBase]: 38/810 cut-off events. [2025-01-09 21:30:06,867 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-01-09 21:30:06,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 810 events. 38/810 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3018 event pairs, 20 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2025-01-09 21:30:06,875 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-01-09 21:30:06,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 1156 flow [2025-01-09 21:30:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-01-09 21:30:06,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-01-09 21:30:06,878 INFO L175 Difference]: Start difference. First operand has 555 places, 559 transitions, 1128 flow. Second operand 3 states and 1795 transitions. [2025-01-09 21:30:06,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 558 transitions, 1156 flow [2025-01-09 21:30:06,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:06,883 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1129 flow [2025-01-09 21:30:06,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1129, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2025-01-09 21:30:06,885 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-01-09 21:30:06,885 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1129 flow [2025-01-09 21:30:06,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:06,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:06,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:06,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:06,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:06,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1462756536, now seen corresponding path program 1 times [2025-01-09 21:30:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:06,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298092932] [2025-01-09 21:30:06,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:06,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:06,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:30:06,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:30:06,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:06,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:06,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298092932] [2025-01-09 21:30:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298092932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942456152] [2025-01-09 21:30:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:06,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:06,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:06,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:06,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 628 [2025-01-09 21:30:06,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:06,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:06,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 628 [2025-01-09 21:30:06,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,043 INFO L124 PetriNetUnfolderBase]: 34/990 cut-off events. [2025-01-09 21:30:07,043 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:30:07,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 990 events. 34/990 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4360 event pairs, 6 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 994. Up to 23 conditions per place. [2025-01-09 21:30:07,052 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 12 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-01-09 21:30:07,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 559 transitions, 1161 flow [2025-01-09 21:30:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-01-09 21:30:07,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-01-09 21:30:07,055 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1129 flow. Second operand 3 states and 1806 transitions. [2025-01-09 21:30:07,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 559 transitions, 1161 flow [2025-01-09 21:30:07,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 559 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:07,061 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1127 flow [2025-01-09 21:30:07,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2025-01-09 21:30:07,062 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -33 predicate places. [2025-01-09 21:30:07,062 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1127 flow [2025-01-09 21:30:07,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:07,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:07,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:07,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1256896032, now seen corresponding path program 1 times [2025-01-09 21:30:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620893575] [2025-01-09 21:30:07,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:07,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:30:07,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:30:07,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:07,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620893575] [2025-01-09 21:30:07,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620893575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360492599] [2025-01-09 21:30:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:07,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:07,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:07,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1127 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:07,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,295 INFO L124 PetriNetUnfolderBase]: 31/876 cut-off events. [2025-01-09 21:30:07,295 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-01-09 21:30:07,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 876 events. 31/876 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3411 event pairs, 6 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2025-01-09 21:30:07,307 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-01-09 21:30:07,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 558 transitions, 1161 flow [2025-01-09 21:30:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-01-09 21:30:07,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-01-09 21:30:07,310 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1127 flow. Second operand 3 states and 1804 transitions. [2025-01-09 21:30:07,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 558 transitions, 1161 flow [2025-01-09 21:30:07,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:07,315 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1125 flow [2025-01-09 21:30:07,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2025-01-09 21:30:07,317 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2025-01-09 21:30:07,317 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1125 flow [2025-01-09 21:30:07,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:07,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:07,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:07,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash -726642479, now seen corresponding path program 1 times [2025-01-09 21:30:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466971096] [2025-01-09 21:30:07,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:07,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:30:07,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:30:07,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:07,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:07,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466971096] [2025-01-09 21:30:07,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466971096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414741682] [2025-01-09 21:30:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:07,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:07,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:07,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:07,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:07,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,469 INFO L124 PetriNetUnfolderBase]: 40/991 cut-off events. [2025-01-09 21:30:07,469 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2025-01-09 21:30:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 991 events. 40/991 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4288 event pairs, 12 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 1022. Up to 39 conditions per place. [2025-01-09 21:30:07,477 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2025-01-09 21:30:07,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 559 transitions, 1167 flow [2025-01-09 21:30:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-01-09 21:30:07,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-01-09 21:30:07,481 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1125 flow. Second operand 3 states and 1806 transitions. [2025-01-09 21:30:07,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 559 transitions, 1167 flow [2025-01-09 21:30:07,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 559 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:07,488 INFO L231 Difference]: Finished difference. Result has 555 places, 557 transitions, 1139 flow [2025-01-09 21:30:07,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=555, PETRI_TRANSITIONS=557} [2025-01-09 21:30:07,490 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-01-09 21:30:07,490 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 557 transitions, 1139 flow [2025-01-09 21:30:07,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:07,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:07,491 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:07,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash 865339479, now seen corresponding path program 1 times [2025-01-09 21:30:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313637298] [2025-01-09 21:30:07,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:07,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:30:07,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:30:07,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:07,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:07,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313637298] [2025-01-09 21:30:07,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313637298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:07,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644620596] [2025-01-09 21:30:07,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:07,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:07,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:07,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-01-09 21:30:07,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 557 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-01-09 21:30:07,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,761 INFO L124 PetriNetUnfolderBase]: 131/2146 cut-off events. [2025-01-09 21:30:07,761 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-01-09 21:30:07,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 2146 events. 131/2146 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14843 event pairs, 24 based on Foata normal form. 0/1905 useless extension candidates. Maximal degree in co-relation 2343. Up to 154 conditions per place. [2025-01-09 21:30:07,786 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 20 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-01-09 21:30:07,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 560 transitions, 1194 flow [2025-01-09 21:30:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2025-01-09 21:30:07,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548832271762208 [2025-01-09 21:30:07,789 INFO L175 Difference]: Start difference. First operand has 555 places, 557 transitions, 1139 flow. Second operand 3 states and 1799 transitions. [2025-01-09 21:30:07,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 560 transitions, 1194 flow [2025-01-09 21:30:07,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 560 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:07,795 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1139 flow [2025-01-09 21:30:07,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2025-01-09 21:30:07,797 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -35 predicate places. [2025-01-09 21:30:07,797 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1139 flow [2025-01-09 21:30:07,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:07,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:07,798 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:07,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1933100223, now seen corresponding path program 1 times [2025-01-09 21:30:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379057776] [2025-01-09 21:30:07,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:07,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:30:07,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:30:07,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:07,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:07,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379057776] [2025-01-09 21:30:07,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379057776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709067982] [2025-01-09 21:30:07,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:07,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:07,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:07,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:07,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,970 INFO L124 PetriNetUnfolderBase]: 63/1137 cut-off events. [2025-01-09 21:30:07,970 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2025-01-09 21:30:07,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1137 events. 63/1137 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5461 event pairs, 12 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1187. Up to 49 conditions per place. [2025-01-09 21:30:07,981 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-01-09 21:30:07,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 556 transitions, 1173 flow [2025-01-09 21:30:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-01-09 21:30:07,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-01-09 21:30:07,984 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1139 flow. Second operand 3 states and 1804 transitions. [2025-01-09 21:30:07,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 556 transitions, 1173 flow [2025-01-09 21:30:07,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1173 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:07,989 INFO L231 Difference]: Finished difference. Result has 553 places, 554 transitions, 1141 flow [2025-01-09 21:30:07,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1141, PETRI_PLACES=553, PETRI_TRANSITIONS=554} [2025-01-09 21:30:07,990 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2025-01-09 21:30:07,991 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 554 transitions, 1141 flow [2025-01-09 21:30:07,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:07,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:07,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:07,992 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:07,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1362136123, now seen corresponding path program 1 times [2025-01-09 21:30:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686709889] [2025-01-09 21:30:07,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:08,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:30:08,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:30:08,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:08,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:08,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686709889] [2025-01-09 21:30:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686709889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402220268] [2025-01-09 21:30:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:08,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:08,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:08,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:08,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-01-09 21:30:08,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 554 transitions, 1141 flow. Second operand has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:08,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:08,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-01-09 21:30:08,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:08,921 INFO L124 PetriNetUnfolderBase]: 98/1577 cut-off events. [2025-01-09 21:30:08,921 INFO L125 PetriNetUnfolderBase]: For 6/38 co-relation queries the response was YES. [2025-01-09 21:30:08,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 1577 events. 98/1577 cut-off events. For 6/38 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8536 event pairs, 45 based on Foata normal form. 5/1448 useless extension candidates. Maximal degree in co-relation 1893. Up to 158 conditions per place. [2025-01-09 21:30:08,937 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 69 selfloop transitions, 15 changer transitions 0/592 dead transitions. [2025-01-09 21:30:08,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 592 transitions, 1401 flow [2025-01-09 21:30:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2025-01-09 21:30:08,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118413433700058 [2025-01-09 21:30:08,946 INFO L175 Difference]: Start difference. First operand has 553 places, 554 transitions, 1141 flow. Second operand 11 states and 6299 transitions. [2025-01-09 21:30:08,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 592 transitions, 1401 flow [2025-01-09 21:30:08,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 592 transitions, 1397 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:08,954 INFO L231 Difference]: Finished difference. Result has 566 places, 562 transitions, 1213 flow [2025-01-09 21:30:08,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1213, PETRI_PLACES=566, PETRI_TRANSITIONS=562} [2025-01-09 21:30:08,956 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -21 predicate places. [2025-01-09 21:30:08,956 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 562 transitions, 1213 flow [2025-01-09 21:30:08,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:08,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:08,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:08,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:08,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:08,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash -280204512, now seen corresponding path program 1 times [2025-01-09 21:30:08,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549249954] [2025-01-09 21:30:08,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:08,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:30:08,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:30:08,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:08,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:09,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549249954] [2025-01-09 21:30:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549249954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770571088] [2025-01-09 21:30:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:09,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:09,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:09,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:09,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:09,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:09,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 562 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:09,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:09,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:09,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:09,315 INFO L124 PetriNetUnfolderBase]: 132/1836 cut-off events. [2025-01-09 21:30:09,315 INFO L125 PetriNetUnfolderBase]: For 91/154 co-relation queries the response was YES. [2025-01-09 21:30:09,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 1836 events. 132/1836 cut-off events. For 91/154 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10895 event pairs, 48 based on Foata normal form. 0/1618 useless extension candidates. Maximal degree in co-relation 2062. Up to 149 conditions per place. [2025-01-09 21:30:09,337 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2025-01-09 21:30:09,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 565 transitions, 1255 flow [2025-01-09 21:30:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-01-09 21:30:09,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-01-09 21:30:09,340 INFO L175 Difference]: Start difference. First operand has 566 places, 562 transitions, 1213 flow. Second operand 3 states and 1806 transitions. [2025-01-09 21:30:09,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 565 transitions, 1255 flow [2025-01-09 21:30:09,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 565 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:09,348 INFO L231 Difference]: Finished difference. Result has 569 places, 563 transitions, 1227 flow [2025-01-09 21:30:09,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=569, PETRI_TRANSITIONS=563} [2025-01-09 21:30:09,348 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2025-01-09 21:30:09,349 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 563 transitions, 1227 flow [2025-01-09 21:30:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:09,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:09,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:09,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:09,351 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -369948816, now seen corresponding path program 1 times [2025-01-09 21:30:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276310722] [2025-01-09 21:30:09,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:09,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:30:09,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:30:09,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:09,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:09,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:09,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276310722] [2025-01-09 21:30:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276310722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:09,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661131745] [2025-01-09 21:30:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:09,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:09,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:09,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:09,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:09,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 563 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:09,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:09,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:09,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:09,745 INFO L124 PetriNetUnfolderBase]: 137/1985 cut-off events. [2025-01-09 21:30:09,745 INFO L125 PetriNetUnfolderBase]: For 68/101 co-relation queries the response was YES. [2025-01-09 21:30:09,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 1985 events. 137/1985 cut-off events. For 68/101 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 12998 event pairs, 48 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 2307. Up to 152 conditions per place. [2025-01-09 21:30:09,773 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/566 dead transitions. [2025-01-09 21:30:09,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 566 transitions, 1269 flow [2025-01-09 21:30:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-01-09 21:30:09,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-01-09 21:30:09,776 INFO L175 Difference]: Start difference. First operand has 569 places, 563 transitions, 1227 flow. Second operand 3 states and 1806 transitions. [2025-01-09 21:30:09,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 566 transitions, 1269 flow [2025-01-09 21:30:09,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 566 transitions, 1263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:09,784 INFO L231 Difference]: Finished difference. Result has 571 places, 564 transitions, 1239 flow [2025-01-09 21:30:09,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=571, PETRI_TRANSITIONS=564} [2025-01-09 21:30:09,785 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -16 predicate places. [2025-01-09 21:30:09,785 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 564 transitions, 1239 flow [2025-01-09 21:30:09,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:09,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:09,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:09,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:09,786 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:09,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash -814672946, now seen corresponding path program 1 times [2025-01-09 21:30:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204635918] [2025-01-09 21:30:09,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:09,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:30:09,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:30:09,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:09,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:09,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204635918] [2025-01-09 21:30:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204635918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:09,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514643859] [2025-01-09 21:30:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:09,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:09,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:09,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:09,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-01-09 21:30:09,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 564 transitions, 1239 flow. Second operand has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:09,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:09,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-01-09 21:30:09,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:10,378 INFO L124 PetriNetUnfolderBase]: 187/3283 cut-off events. [2025-01-09 21:30:10,379 INFO L125 PetriNetUnfolderBase]: For 58/76 co-relation queries the response was YES. [2025-01-09 21:30:10,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3793 conditions, 3283 events. 187/3283 cut-off events. For 58/76 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 25357 event pairs, 33 based on Foata normal form. 0/2960 useless extension candidates. Maximal degree in co-relation 3733. Up to 220 conditions per place. [2025-01-09 21:30:10,419 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 20 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-01-09 21:30:10,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 567 transitions, 1294 flow [2025-01-09 21:30:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2025-01-09 21:30:10,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548832271762208 [2025-01-09 21:30:10,422 INFO L175 Difference]: Start difference. First operand has 571 places, 564 transitions, 1239 flow. Second operand 3 states and 1799 transitions. [2025-01-09 21:30:10,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 567 transitions, 1294 flow [2025-01-09 21:30:10,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 567 transitions, 1288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:10,431 INFO L231 Difference]: Finished difference. Result has 568 places, 562 transitions, 1239 flow [2025-01-09 21:30:10,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=568, PETRI_TRANSITIONS=562} [2025-01-09 21:30:10,432 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2025-01-09 21:30:10,432 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 562 transitions, 1239 flow [2025-01-09 21:30:10,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:10,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:10,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:10,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:10,433 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:10,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 805135923, now seen corresponding path program 1 times [2025-01-09 21:30:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:10,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424597899] [2025-01-09 21:30:10,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:10,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:30:10,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:30:10,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:10,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424597899] [2025-01-09 21:30:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424597899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:10,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106273817] [2025-01-09 21:30:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:10,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:10,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:10,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:11,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-01-09 21:30:11,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 562 transitions, 1239 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:11,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:11,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-01-09 21:30:11,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:11,638 INFO L124 PetriNetUnfolderBase]: 170/2424 cut-off events. [2025-01-09 21:30:11,638 INFO L125 PetriNetUnfolderBase]: For 82/134 co-relation queries the response was YES. [2025-01-09 21:30:11,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 2424 events. 170/2424 cut-off events. For 82/134 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 16125 event pairs, 79 based on Foata normal form. 3/2187 useless extension candidates. Maximal degree in co-relation 2962. Up to 259 conditions per place. [2025-01-09 21:30:11,669 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 69 selfloop transitions, 15 changer transitions 0/595 dead transitions. [2025-01-09 21:30:11,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 595 transitions, 1489 flow [2025-01-09 21:30:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2025-01-09 21:30:11,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118413433700058 [2025-01-09 21:30:11,678 INFO L175 Difference]: Start difference. First operand has 568 places, 562 transitions, 1239 flow. Second operand 11 states and 6299 transitions. [2025-01-09 21:30:11,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 595 transitions, 1489 flow [2025-01-09 21:30:11,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 595 transitions, 1489 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:11,686 INFO L231 Difference]: Finished difference. Result has 581 places, 565 transitions, 1294 flow [2025-01-09 21:30:11,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=581, PETRI_TRANSITIONS=565} [2025-01-09 21:30:11,687 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -6 predicate places. [2025-01-09 21:30:11,687 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 565 transitions, 1294 flow [2025-01-09 21:30:11,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:11,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:11,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:11,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:11,688 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:11,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:11,689 INFO L85 PathProgramCache]: Analyzing trace with hash -462509902, now seen corresponding path program 1 times [2025-01-09 21:30:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:11,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317290550] [2025-01-09 21:30:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:11,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:11,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 21:30:11,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 21:30:11,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:11,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:11,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:11,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317290550] [2025-01-09 21:30:11,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317290550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:11,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:11,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781926056] [2025-01-09 21:30:11,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:11,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:11,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:11,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:12,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-01-09 21:30:12,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 565 transitions, 1294 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:12,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:12,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-01-09 21:30:12,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:12,747 INFO L124 PetriNetUnfolderBase]: 245/3127 cut-off events. [2025-01-09 21:30:12,747 INFO L125 PetriNetUnfolderBase]: For 227/285 co-relation queries the response was YES. [2025-01-09 21:30:12,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 3127 events. 245/3127 cut-off events. For 227/285 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 24425 event pairs, 103 based on Foata normal form. 10/2849 useless extension candidates. Maximal degree in co-relation 3915. Up to 347 conditions per place. [2025-01-09 21:30:12,779 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 65 selfloop transitions, 15 changer transitions 0/594 dead transitions. [2025-01-09 21:30:12,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 594 transitions, 1528 flow [2025-01-09 21:30:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6290 transitions. [2025-01-09 21:30:12,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105385060799074 [2025-01-09 21:30:12,785 INFO L175 Difference]: Start difference. First operand has 581 places, 565 transitions, 1294 flow. Second operand 11 states and 6290 transitions. [2025-01-09 21:30:12,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 594 transitions, 1528 flow [2025-01-09 21:30:12,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 594 transitions, 1507 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-09 21:30:12,792 INFO L231 Difference]: Finished difference. Result has 589 places, 573 transitions, 1349 flow [2025-01-09 21:30:12,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1349, PETRI_PLACES=589, PETRI_TRANSITIONS=573} [2025-01-09 21:30:12,793 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 2 predicate places. [2025-01-09 21:30:12,793 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 573 transitions, 1349 flow [2025-01-09 21:30:12,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:12,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:12,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:12,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:12,794 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1368170084, now seen corresponding path program 1 times [2025-01-09 21:30:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:12,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649557022] [2025-01-09 21:30:12,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:12,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:12,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 21:30:12,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 21:30:12,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:12,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:12,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649557022] [2025-01-09 21:30:12,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649557022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:12,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:12,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:12,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389502258] [2025-01-09 21:30:12,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:12,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:12,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:12,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:12,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:13,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-01-09 21:30:13,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 573 transitions, 1349 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:13,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:13,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-01-09 21:30:13,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:13,710 INFO L124 PetriNetUnfolderBase]: 147/2380 cut-off events. [2025-01-09 21:30:13,710 INFO L125 PetriNetUnfolderBase]: For 118/172 co-relation queries the response was YES. [2025-01-09 21:30:13,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3233 conditions, 2380 events. 147/2380 cut-off events. For 118/172 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 15085 event pairs, 55 based on Foata normal form. 2/2219 useless extension candidates. Maximal degree in co-relation 3157. Up to 233 conditions per place. [2025-01-09 21:30:13,731 INFO L140 encePairwiseOnDemand]: 613/628 looper letters, 71 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2025-01-09 21:30:13,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 603 transitions, 1627 flow [2025-01-09 21:30:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6292 transitions. [2025-01-09 21:30:13,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910828025477707 [2025-01-09 21:30:13,739 INFO L175 Difference]: Start difference. First operand has 589 places, 573 transitions, 1349 flow. Second operand 11 states and 6292 transitions. [2025-01-09 21:30:13,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 603 transitions, 1627 flow [2025-01-09 21:30:13,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 603 transitions, 1623 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:13,745 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1440 flow [2025-01-09 21:30:13,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1440, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2025-01-09 21:30:13,747 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2025-01-09 21:30:13,747 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1440 flow [2025-01-09 21:30:13,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:13,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:13,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:13,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:13,748 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:13,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash 610497948, now seen corresponding path program 1 times [2025-01-09 21:30:13,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:13,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38545740] [2025-01-09 21:30:13,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:13,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 21:30:13,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 21:30:13,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:13,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:13,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:13,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38545740] [2025-01-09 21:30:13,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38545740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:13,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:13,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610635201] [2025-01-09 21:30:13,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:13,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:13,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:14,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-01-09 21:30:14,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1440 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:14,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:14,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-01-09 21:30:14,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:14,921 INFO L124 PetriNetUnfolderBase]: 338/4947 cut-off events. [2025-01-09 21:30:14,921 INFO L125 PetriNetUnfolderBase]: For 466/624 co-relation queries the response was YES. [2025-01-09 21:30:14,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 4947 events. 338/4947 cut-off events. For 466/624 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 42804 event pairs, 127 based on Foata normal form. 4/4536 useless extension candidates. Maximal degree in co-relation 6594. Up to 348 conditions per place. [2025-01-09 21:30:14,993 INFO L140 encePairwiseOnDemand]: 612/628 looper letters, 65 selfloop transitions, 22 changer transitions 0/607 dead transitions. [2025-01-09 21:30:14,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 607 transitions, 1712 flow [2025-01-09 21:30:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:30:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:30:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6851 transitions. [2025-01-09 21:30:15,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9091029723991507 [2025-01-09 21:30:15,000 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1440 flow. Second operand 12 states and 6851 transitions. [2025-01-09 21:30:15,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 607 transitions, 1712 flow [2025-01-09 21:30:15,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 607 transitions, 1691 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-09 21:30:15,010 INFO L231 Difference]: Finished difference. Result has 611 places, 591 transitions, 1551 flow [2025-01-09 21:30:15,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1551, PETRI_PLACES=611, PETRI_TRANSITIONS=591} [2025-01-09 21:30:15,011 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 24 predicate places. [2025-01-09 21:30:15,011 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 591 transitions, 1551 flow [2025-01-09 21:30:15,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:15,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:15,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:15,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:15,012 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:15,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash 531925046, now seen corresponding path program 1 times [2025-01-09 21:30:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:15,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952363909] [2025-01-09 21:30:15,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:15,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:15,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 21:30:15,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 21:30:15,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:15,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:15,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:15,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952363909] [2025-01-09 21:30:15,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952363909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:15,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:15,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:15,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503604831] [2025-01-09 21:30:15,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:15,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:15,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:15,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:15,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:15,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-01-09 21:30:15,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 591 transitions, 1551 flow. Second operand has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:15,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:15,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-01-09 21:30:15,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:16,119 INFO L124 PetriNetUnfolderBase]: 296/3575 cut-off events. [2025-01-09 21:30:16,119 INFO L125 PetriNetUnfolderBase]: For 644/703 co-relation queries the response was YES. [2025-01-09 21:30:16,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5122 conditions, 3575 events. 296/3575 cut-off events. For 644/703 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 28628 event pairs, 121 based on Foata normal form. 1/3307 useless extension candidates. Maximal degree in co-relation 5033. Up to 333 conditions per place. [2025-01-09 21:30:16,157 INFO L140 encePairwiseOnDemand]: 612/628 looper letters, 65 selfloop transitions, 22 changer transitions 0/614 dead transitions. [2025-01-09 21:30:16,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 614 transitions, 1813 flow [2025-01-09 21:30:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:30:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:30:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6851 transitions. [2025-01-09 21:30:16,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9091029723991507 [2025-01-09 21:30:16,160 INFO L175 Difference]: Start difference. First operand has 611 places, 591 transitions, 1551 flow. Second operand 12 states and 6851 transitions. [2025-01-09 21:30:16,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 614 transitions, 1813 flow [2025-01-09 21:30:16,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 614 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:16,169 INFO L231 Difference]: Finished difference. Result has 626 places, 598 transitions, 1662 flow [2025-01-09 21:30:16,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1662, PETRI_PLACES=626, PETRI_TRANSITIONS=598} [2025-01-09 21:30:16,170 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 39 predicate places. [2025-01-09 21:30:16,170 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 598 transitions, 1662 flow [2025-01-09 21:30:16,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:16,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:16,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:16,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:16,171 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:16,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:16,171 INFO L85 PathProgramCache]: Analyzing trace with hash -790574986, now seen corresponding path program 1 times [2025-01-09 21:30:16,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:16,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946239930] [2025-01-09 21:30:16,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:16,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 21:30:16,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 21:30:16,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:16,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946239930] [2025-01-09 21:30:16,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946239930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:16,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:16,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:16,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100969675] [2025-01-09 21:30:16,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:16,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:16,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:16,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:16,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:16,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-01-09 21:30:16,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 598 transitions, 1662 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:16,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:16,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-01-09 21:30:16,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,462 INFO L124 PetriNetUnfolderBase]: 157/3538 cut-off events. [2025-01-09 21:30:17,462 INFO L125 PetriNetUnfolderBase]: For 632/676 co-relation queries the response was YES. [2025-01-09 21:30:17,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 3538 events. 157/3538 cut-off events. For 632/676 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 25882 event pairs, 22 based on Foata normal form. 12/3338 useless extension candidates. Maximal degree in co-relation 4953. Up to 173 conditions per place. [2025-01-09 21:30:17,492 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 41 selfloop transitions, 5 changer transitions 0/607 dead transitions. [2025-01-09 21:30:17,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 607 transitions, 1783 flow [2025-01-09 21:30:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2025-01-09 21:30:17,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929140127388535 [2025-01-09 21:30:17,495 INFO L175 Difference]: Start difference. First operand has 626 places, 598 transitions, 1662 flow. Second operand 6 states and 3501 transitions. [2025-01-09 21:30:17,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 607 transitions, 1783 flow [2025-01-09 21:30:17,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 607 transitions, 1766 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:17,503 INFO L231 Difference]: Finished difference. Result has 623 places, 596 transitions, 1651 flow [2025-01-09 21:30:17,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1651, PETRI_PLACES=623, PETRI_TRANSITIONS=596} [2025-01-09 21:30:17,504 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 36 predicate places. [2025-01-09 21:30:17,504 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 596 transitions, 1651 flow [2025-01-09 21:30:17,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:17,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:17,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:17,506 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:17,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1368124867, now seen corresponding path program 1 times [2025-01-09 21:30:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438089522] [2025-01-09 21:30:17,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:17,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 21:30:17,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 21:30:17,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:17,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438089522] [2025-01-09 21:30:17,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438089522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:17,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:17,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:17,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097134613] [2025-01-09 21:30:17,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:17,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:17,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:17,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:18,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-01-09 21:30:18,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 596 transitions, 1651 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:18,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-01-09 21:30:18,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,844 INFO L124 PetriNetUnfolderBase]: 186/3895 cut-off events. [2025-01-09 21:30:18,845 INFO L125 PetriNetUnfolderBase]: For 765/863 co-relation queries the response was YES. [2025-01-09 21:30:18,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5532 conditions, 3895 events. 186/3895 cut-off events. For 765/863 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 30277 event pairs, 30 based on Foata normal form. 8/3651 useless extension candidates. Maximal degree in co-relation 5435. Up to 197 conditions per place. [2025-01-09 21:30:18,895 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 40 selfloop transitions, 5 changer transitions 0/604 dead transitions. [2025-01-09 21:30:18,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 604 transitions, 1767 flow [2025-01-09 21:30:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2025-01-09 21:30:18,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288747346072187 [2025-01-09 21:30:18,898 INFO L175 Difference]: Start difference. First operand has 623 places, 596 transitions, 1651 flow. Second operand 6 states and 3500 transitions. [2025-01-09 21:30:18,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 604 transitions, 1767 flow [2025-01-09 21:30:18,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 604 transitions, 1757 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:18,908 INFO L231 Difference]: Finished difference. Result has 621 places, 594 transitions, 1647 flow [2025-01-09 21:30:18,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1647, PETRI_PLACES=621, PETRI_TRANSITIONS=594} [2025-01-09 21:30:18,909 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 34 predicate places. [2025-01-09 21:30:18,909 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 594 transitions, 1647 flow [2025-01-09 21:30:18,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:18,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:18,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:30:18,910 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:18,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash 508054693, now seen corresponding path program 1 times [2025-01-09 21:30:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062238581] [2025-01-09 21:30:18,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:30:18,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:30:18,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062238581] [2025-01-09 21:30:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062238581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912920178] [2025-01-09 21:30:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-01-09 21:30:18,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 594 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:18,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-01-09 21:30:18,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,753 INFO L124 PetriNetUnfolderBase]: 328/6084 cut-off events. [2025-01-09 21:30:19,753 INFO L125 PetriNetUnfolderBase]: For 612/632 co-relation queries the response was YES. [2025-01-09 21:30:19,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7855 conditions, 6084 events. 328/6084 cut-off events. For 612/632 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 54764 event pairs, 55 based on Foata normal form. 0/5641 useless extension candidates. Maximal degree in co-relation 7759. Up to 393 conditions per place. [2025-01-09 21:30:19,813 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 19 selfloop transitions, 2 changer transitions 0/596 dead transitions. [2025-01-09 21:30:19,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 596 transitions, 1697 flow [2025-01-09 21:30:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2025-01-09 21:30:19,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9543524416135881 [2025-01-09 21:30:19,815 INFO L175 Difference]: Start difference. First operand has 621 places, 594 transitions, 1647 flow. Second operand 3 states and 1798 transitions. [2025-01-09 21:30:19,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 596 transitions, 1697 flow [2025-01-09 21:30:19,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 596 transitions, 1687 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:19,825 INFO L231 Difference]: Finished difference. Result has 615 places, 592 transitions, 1643 flow [2025-01-09 21:30:19,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=615, PETRI_TRANSITIONS=592} [2025-01-09 21:30:19,826 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 28 predicate places. [2025-01-09 21:30:19,826 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 592 transitions, 1643 flow [2025-01-09 21:30:19,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:19,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:19,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:30:19,827 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:19,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 747283228, now seen corresponding path program 1 times [2025-01-09 21:30:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:19,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461078200] [2025-01-09 21:30:19,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:19,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:30:19,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:30:19,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:20,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461078200] [2025-01-09 21:30:20,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461078200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009929901] [2025-01-09 21:30:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:20,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:20,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:20,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:20,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-01-09 21:30:20,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 592 transitions, 1643 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:20,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:20,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-01-09 21:30:20,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:21,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1732] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 838#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 462#L105true, 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), Black: 697#true]) [2025-01-09 21:30:21,136 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-01-09 21:30:21,136 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:21,136 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-01-09 21:30:21,136 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:21,159 INFO L124 PetriNetUnfolderBase]: 161/3896 cut-off events. [2025-01-09 21:30:21,159 INFO L125 PetriNetUnfolderBase]: For 628/684 co-relation queries the response was YES. [2025-01-09 21:30:21,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 3896 events. 161/3896 cut-off events. For 628/684 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 29337 event pairs, 24 based on Foata normal form. 12/3701 useless extension candidates. Maximal degree in co-relation 5311. Up to 177 conditions per place. [2025-01-09 21:30:21,184 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 41 selfloop transitions, 5 changer transitions 0/601 dead transitions. [2025-01-09 21:30:21,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 601 transitions, 1764 flow [2025-01-09 21:30:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2025-01-09 21:30:21,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929140127388535 [2025-01-09 21:30:21,186 INFO L175 Difference]: Start difference. First operand has 615 places, 592 transitions, 1643 flow. Second operand 6 states and 3501 transitions. [2025-01-09 21:30:21,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 601 transitions, 1764 flow [2025-01-09 21:30:21,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 601 transitions, 1764 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:21,194 INFO L231 Difference]: Finished difference. Result has 618 places, 590 transitions, 1649 flow [2025-01-09 21:30:21,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1649, PETRI_PLACES=618, PETRI_TRANSITIONS=590} [2025-01-09 21:30:21,199 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 31 predicate places. [2025-01-09 21:30:21,200 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 590 transitions, 1649 flow [2025-01-09 21:30:21,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:21,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:21,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:30:21,201 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:21,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -172945401, now seen corresponding path program 1 times [2025-01-09 21:30:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211553936] [2025-01-09 21:30:21,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:21,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 21:30:21,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 21:30:21,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:21,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211553936] [2025-01-09 21:30:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211553936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:21,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831501848] [2025-01-09 21:30:21,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:21,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:21,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-01-09 21:30:21,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 590 transitions, 1649 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:21,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:21,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-01-09 21:30:21,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1731] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][480], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 317#L104true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), 838#true, Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 295#L79-3true, 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 846#(= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), 772#true, Black: 803#(<= ~n3~0 0), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), Black: 697#true]) [2025-01-09 21:30:22,468 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-01-09 21:30:22,468 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-01-09 21:30:22,468 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-01-09 21:30:22,468 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-01-09 21:30:22,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1731] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][486], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 317#L104true, 634#(= |#race~n2~0| 0), 838#true, Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 847#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 772#true, Black: 803#(<= ~n3~0 0), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), 207#L79-4true, Black: 697#true]) [2025-01-09 21:30:22,473 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-01-09 21:30:22,473 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-01-09 21:30:22,473 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-01-09 21:30:22,473 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2025-01-09 21:30:22,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1731] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][492], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 170#L79-5true, Black: 834#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 317#L104true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), 838#true, Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 848#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 772#true, Black: 803#(<= ~n3~0 0), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), Black: 697#true]) [2025-01-09 21:30:22,478 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-01-09 21:30:22,478 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-01-09 21:30:22,478 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-01-09 21:30:22,478 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-01-09 21:30:22,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1731] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][497], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 154#L79-6true, Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 317#L104true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), 838#true, Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 849#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 772#true, Black: 803#(<= ~n3~0 0), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), Black: 697#true]) [2025-01-09 21:30:22,482 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2025-01-09 21:30:22,482 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-01-09 21:30:22,482 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-01-09 21:30:22,482 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-01-09 21:30:22,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1731] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][497], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 317#L104true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), 838#true, Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 849#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 772#true, Black: 803#(<= ~n3~0 0), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), 129#L79-7true, Black: 697#true]) [2025-01-09 21:30:22,485 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:22,485 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-01-09 21:30:22,485 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-01-09 21:30:22,485 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-01-09 21:30:22,612 INFO L124 PetriNetUnfolderBase]: 334/4764 cut-off events. [2025-01-09 21:30:22,612 INFO L125 PetriNetUnfolderBase]: For 1038/1086 co-relation queries the response was YES. [2025-01-09 21:30:22,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6823 conditions, 4764 events. 334/4764 cut-off events. For 1038/1086 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 40437 event pairs, 40 based on Foata normal form. 8/4500 useless extension candidates. Maximal degree in co-relation 6725. Up to 251 conditions per place. [2025-01-09 21:30:22,661 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 39 selfloop transitions, 5 changer transitions 0/597 dead transitions. [2025-01-09 21:30:22,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 597 transitions, 1760 flow [2025-01-09 21:30:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-01-09 21:30:22,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9286093418259024 [2025-01-09 21:30:22,663 INFO L175 Difference]: Start difference. First operand has 618 places, 590 transitions, 1649 flow. Second operand 6 states and 3499 transitions. [2025-01-09 21:30:22,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 597 transitions, 1760 flow [2025-01-09 21:30:22,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 597 transitions, 1750 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:22,673 INFO L231 Difference]: Finished difference. Result has 616 places, 588 transitions, 1645 flow [2025-01-09 21:30:22,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1645, PETRI_PLACES=616, PETRI_TRANSITIONS=588} [2025-01-09 21:30:22,674 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 29 predicate places. [2025-01-09 21:30:22,674 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 588 transitions, 1645 flow [2025-01-09 21:30:22,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:22,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:30:22,675 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:22,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2026777367, now seen corresponding path program 1 times [2025-01-09 21:30:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917876486] [2025-01-09 21:30:22,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:30:22,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:30:22,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:30:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917876486] [2025-01-09 21:30:22,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917876486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:22,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516638759] [2025-01-09 21:30:22,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:22,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:23,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-01-09 21:30:23,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 588 transitions, 1645 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-01-09 21:30:23,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:23,910 INFO L124 PetriNetUnfolderBase]: 195/4259 cut-off events. [2025-01-09 21:30:23,910 INFO L125 PetriNetUnfolderBase]: For 761/853 co-relation queries the response was YES. [2025-01-09 21:30:23,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6016 conditions, 4259 events. 195/4259 cut-off events. For 761/853 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 33432 event pairs, 29 based on Foata normal form. 7/4060 useless extension candidates. Maximal degree in co-relation 5918. Up to 196 conditions per place. [2025-01-09 21:30:23,951 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 40 selfloop transitions, 5 changer transitions 0/596 dead transitions. [2025-01-09 21:30:23,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 596 transitions, 1761 flow [2025-01-09 21:30:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2025-01-09 21:30:23,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288747346072187 [2025-01-09 21:30:23,953 INFO L175 Difference]: Start difference. First operand has 616 places, 588 transitions, 1645 flow. Second operand 6 states and 3500 transitions. [2025-01-09 21:30:23,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 596 transitions, 1761 flow [2025-01-09 21:30:23,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 596 transitions, 1751 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:23,962 INFO L231 Difference]: Finished difference. Result has 614 places, 586 transitions, 1641 flow [2025-01-09 21:30:23,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1641, PETRI_PLACES=614, PETRI_TRANSITIONS=586} [2025-01-09 21:30:23,962 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 27 predicate places. [2025-01-09 21:30:23,963 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 586 transitions, 1641 flow [2025-01-09 21:30:23,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:23,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:23,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:23,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:30:23,963 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:23,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1712463333, now seen corresponding path program 1 times [2025-01-09 21:30:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:23,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645715736] [2025-01-09 21:30:23,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:23,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 21:30:23,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 21:30:23,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:23,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645715736] [2025-01-09 21:30:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645715736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983558466] [2025-01-09 21:30:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:23,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:24,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 628 [2025-01-09 21:30:24,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 586 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 628 [2025-01-09 21:30:24,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1732] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 655#true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 850#true, 462#L105true, 699#(= |#race~a2~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), 772#true, Black: 803#(<= ~n3~0 0), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), 856#true, Black: 697#true]) [2025-01-09 21:30:24,447 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-01-09 21:30:24,447 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:24,448 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-01-09 21:30:24,448 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:24,497 INFO L124 PetriNetUnfolderBase]: 130/4207 cut-off events. [2025-01-09 21:30:24,497 INFO L125 PetriNetUnfolderBase]: For 653/695 co-relation queries the response was YES. [2025-01-09 21:30:24,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5724 conditions, 4207 events. 130/4207 cut-off events. For 653/695 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 31488 event pairs, 22 based on Foata normal form. 0/4036 useless extension candidates. Maximal degree in co-relation 5627. Up to 124 conditions per place. [2025-01-09 21:30:24,659 INFO L140 encePairwiseOnDemand]: 626/628 looper letters, 9 selfloop transitions, 1 changer transitions 0/585 dead transitions. [2025-01-09 21:30:24,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 585 transitions, 1659 flow [2025-01-09 21:30:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1808 transitions. [2025-01-09 21:30:24,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596602972399151 [2025-01-09 21:30:24,661 INFO L175 Difference]: Start difference. First operand has 614 places, 586 transitions, 1641 flow. Second operand 3 states and 1808 transitions. [2025-01-09 21:30:24,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 585 transitions, 1659 flow [2025-01-09 21:30:24,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 585 transitions, 1649 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:24,669 INFO L231 Difference]: Finished difference. Result has 610 places, 585 transitions, 1631 flow [2025-01-09 21:30:24,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1631, PETRI_PLACES=610, PETRI_TRANSITIONS=585} [2025-01-09 21:30:24,669 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 23 predicate places. [2025-01-09 21:30:24,669 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 585 transitions, 1631 flow [2025-01-09 21:30:24,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:24,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:24,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:30:24,670 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash -409068371, now seen corresponding path program 1 times [2025-01-09 21:30:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792714126] [2025-01-09 21:30:24,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:30:24,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:30:24,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:24,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792714126] [2025-01-09 21:30:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792714126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116869921] [2025-01-09 21:30:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:24,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:24,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:25,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-01-09 21:30:25,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 585 transitions, 1631 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-01-09 21:30:25,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,925 INFO L124 PetriNetUnfolderBase]: 220/4123 cut-off events. [2025-01-09 21:30:25,925 INFO L125 PetriNetUnfolderBase]: For 870/899 co-relation queries the response was YES. [2025-01-09 21:30:25,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5872 conditions, 4123 events. 220/4123 cut-off events. For 870/899 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 32493 event pairs, 32 based on Foata normal form. 0/3979 useless extension candidates. Maximal degree in co-relation 5774. Up to 204 conditions per place. [2025-01-09 21:30:25,964 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 39 selfloop transitions, 5 changer transitions 0/592 dead transitions. [2025-01-09 21:30:25,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 592 transitions, 1742 flow [2025-01-09 21:30:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-01-09 21:30:25,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9286093418259024 [2025-01-09 21:30:25,966 INFO L175 Difference]: Start difference. First operand has 610 places, 585 transitions, 1631 flow. Second operand 6 states and 3499 transitions. [2025-01-09 21:30:25,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 592 transitions, 1742 flow [2025-01-09 21:30:25,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 592 transitions, 1741 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:25,975 INFO L231 Difference]: Finished difference. Result has 612 places, 583 transitions, 1636 flow [2025-01-09 21:30:25,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1636, PETRI_PLACES=612, PETRI_TRANSITIONS=583} [2025-01-09 21:30:25,976 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 25 predicate places. [2025-01-09 21:30:25,976 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 583 transitions, 1636 flow [2025-01-09 21:30:25,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:25,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:30:25,977 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1749154633, now seen corresponding path program 1 times [2025-01-09 21:30:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083079243] [2025-01-09 21:30:25,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 21:30:25,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 21:30:25,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:26,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083079243] [2025-01-09 21:30:26,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083079243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:26,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:26,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720884367] [2025-01-09 21:30:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:26,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:26,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:26,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:26,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:26,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 583 transitions, 1636 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:26,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:26,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1732] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 655#true, Black: 706#(<= ~n1~0 0), 865#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 462#L105true, 699#(= |#race~a2~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 859#true, 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), Black: 697#true]) [2025-01-09 21:30:26,408 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-01-09 21:30:26,408 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-01-09 21:30:26,408 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:26,408 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-01-09 21:30:26,463 INFO L124 PetriNetUnfolderBase]: 120/3723 cut-off events. [2025-01-09 21:30:26,463 INFO L125 PetriNetUnfolderBase]: For 548/614 co-relation queries the response was YES. [2025-01-09 21:30:26,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 3723 events. 120/3723 cut-off events. For 548/614 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 26333 event pairs, 27 based on Foata normal form. 0/3615 useless extension candidates. Maximal degree in co-relation 5039. Up to 133 conditions per place. [2025-01-09 21:30:26,498 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 11 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2025-01-09 21:30:26,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 581 transitions, 1656 flow [2025-01-09 21:30:26,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2025-01-09 21:30:26,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9564755838641189 [2025-01-09 21:30:26,500 INFO L175 Difference]: Start difference. First operand has 612 places, 583 transitions, 1636 flow. Second operand 3 states and 1802 transitions. [2025-01-09 21:30:26,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 581 transitions, 1656 flow [2025-01-09 21:30:26,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 581 transitions, 1646 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:26,508 INFO L231 Difference]: Finished difference. Result has 607 places, 581 transitions, 1624 flow [2025-01-09 21:30:26,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1624, PETRI_PLACES=607, PETRI_TRANSITIONS=581} [2025-01-09 21:30:26,509 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 20 predicate places. [2025-01-09 21:30:26,509 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 581 transitions, 1624 flow [2025-01-09 21:30:26,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:26,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:26,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:30:26,509 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:26,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1541051916, now seen corresponding path program 1 times [2025-01-09 21:30:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61087779] [2025-01-09 21:30:26,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:26,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 21:30:26,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 21:30:26,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:26,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61087779] [2025-01-09 21:30:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61087779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507164476] [2025-01-09 21:30:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:26,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:26,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:26,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:26,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:26,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 581 transitions, 1624 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:26,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:26,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,918 INFO L124 PetriNetUnfolderBase]: 120/3068 cut-off events. [2025-01-09 21:30:26,918 INFO L125 PetriNetUnfolderBase]: For 428/468 co-relation queries the response was YES. [2025-01-09 21:30:26,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4195 conditions, 3068 events. 120/3068 cut-off events. For 428/468 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 20803 event pairs, 33 based on Foata normal form. 15/3009 useless extension candidates. Maximal degree in co-relation 4098. Up to 144 conditions per place. [2025-01-09 21:30:26,948 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 7 selfloop transitions, 0 changer transitions 24/579 dead transitions. [2025-01-09 21:30:26,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 579 transitions, 1642 flow [2025-01-09 21:30:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-01-09 21:30:26,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-01-09 21:30:26,950 INFO L175 Difference]: Start difference. First operand has 607 places, 581 transitions, 1624 flow. Second operand 3 states and 1801 transitions. [2025-01-09 21:30:26,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 579 transitions, 1642 flow [2025-01-09 21:30:26,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 579 transitions, 1641 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:26,958 INFO L231 Difference]: Finished difference. Result has 606 places, 555 transitions, 1514 flow [2025-01-09 21:30:26,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=606, PETRI_TRANSITIONS=555} [2025-01-09 21:30:26,959 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 19 predicate places. [2025-01-09 21:30:26,959 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 555 transitions, 1514 flow [2025-01-09 21:30:26,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:26,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:26,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:30:26,960 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:26,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:26,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1056502872, now seen corresponding path program 1 times [2025-01-09 21:30:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:26,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094922685] [2025-01-09 21:30:26,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:26,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-09 21:30:26,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-09 21:30:26,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:26,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:30:27,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094922685] [2025-01-09 21:30:27,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094922685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972765536] [2025-01-09 21:30:27,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:27,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:27,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:27,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 628 [2025-01-09 21:30:27,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 555 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 628 [2025-01-09 21:30:27,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,450 INFO L124 PetriNetUnfolderBase]: 140/3562 cut-off events. [2025-01-09 21:30:27,450 INFO L125 PetriNetUnfolderBase]: For 460/480 co-relation queries the response was YES. [2025-01-09 21:30:27,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4827 conditions, 3562 events. 140/3562 cut-off events. For 460/480 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 23852 event pairs, 20 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4792. Up to 93 conditions per place. [2025-01-09 21:30:27,486 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 10 selfloop transitions, 2 changer transitions 14/556 dead transitions. [2025-01-09 21:30:27,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 556 transitions, 1542 flow [2025-01-09 21:30:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-01-09 21:30:27,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-01-09 21:30:27,487 INFO L175 Difference]: Start difference. First operand has 606 places, 555 transitions, 1514 flow. Second operand 3 states and 1804 transitions. [2025-01-09 21:30:27,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 556 transitions, 1542 flow [2025-01-09 21:30:27,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 556 transitions, 1534 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:27,496 INFO L231 Difference]: Finished difference. Result has 586 places, 540 transitions, 1414 flow [2025-01-09 21:30:27,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1414, PETRI_PLACES=586, PETRI_TRANSITIONS=540} [2025-01-09 21:30:27,497 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -1 predicate places. [2025-01-09 21:30:27,497 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 540 transitions, 1414 flow [2025-01-09 21:30:27,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:27,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:30:27,498 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:27,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 897499102, now seen corresponding path program 1 times [2025-01-09 21:30:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048600944] [2025-01-09 21:30:27,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 21:30:27,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 21:30:27,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 21:30:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048600944] [2025-01-09 21:30:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048600944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565527944] [2025-01-09 21:30:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:27,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:27,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:27,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:27,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 540 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:27,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L51-7-->L51-8: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][375], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 137#L79true, 622#(= |#race~n1~0| 0), 871#true, Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, 51#L102-4true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 874#true, Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 476#L51-8true, 699#(= |#race~a2~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 803#(<= ~n3~0 0), 772#true, Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), 868#true, 371#L65true, Black: 697#true]) [2025-01-09 21:30:27,941 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-01-09 21:30:27,941 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-01-09 21:30:27,941 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-01-09 21:30:27,941 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-01-09 21:30:27,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1731] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][351], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 834#true, 137#L79true, 622#(= |#race~n1~0| 0), 871#true, Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 798#true, Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0)), Black: 655#true, Black: 720#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 317#L104true, Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 874#true, Black: 791#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n2~0 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 657#(= |#race~a1~0| 0), Black: 817#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 804#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 772#true, Black: 803#(<= ~n3~0 0), Black: 694#(not |thread2Thread1of1ForFork2_#t~short11#1|), 836#(= |#race~a3~0| 0), 868#true, Black: 697#true]) [2025-01-09 21:30:27,974 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-01-09 21:30:27,974 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-01-09 21:30:27,974 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-01-09 21:30:27,974 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-01-09 21:30:27,979 INFO L124 PetriNetUnfolderBase]: 135/2905 cut-off events. [2025-01-09 21:30:27,979 INFO L125 PetriNetUnfolderBase]: For 298/321 co-relation queries the response was YES. [2025-01-09 21:30:27,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3833 conditions, 2905 events. 135/2905 cut-off events. For 298/321 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18487 event pairs, 27 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 3797. Up to 90 conditions per place. [2025-01-09 21:30:28,004 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 10 selfloop transitions, 2 changer transitions 11/541 dead transitions. [2025-01-09 21:30:28,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 541 transitions, 1442 flow [2025-01-09 21:30:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-01-09 21:30:28,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-01-09 21:30:28,005 INFO L175 Difference]: Start difference. First operand has 586 places, 540 transitions, 1414 flow. Second operand 3 states and 1801 transitions. [2025-01-09 21:30:28,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 541 transitions, 1442 flow [2025-01-09 21:30:28,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 541 transitions, 1380 flow, removed 9 selfloop flow, removed 17 redundant places. [2025-01-09 21:30:28,012 INFO L231 Difference]: Finished difference. Result has 563 places, 528 transitions, 1281 flow [2025-01-09 21:30:28,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1281, PETRI_PLACES=563, PETRI_TRANSITIONS=528} [2025-01-09 21:30:28,012 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -24 predicate places. [2025-01-09 21:30:28,012 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 528 transitions, 1281 flow [2025-01-09 21:30:28,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:28,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:28,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:28,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:30:28,013 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-01-09 21:30:28,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash 56048333, now seen corresponding path program 1 times [2025-01-09 21:30:28,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:28,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942995359] [2025-01-09 21:30:28,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:28,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-09 21:30:28,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 21:30:28,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:28,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942995359] [2025-01-09 21:30:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942995359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202341200] [2025-01-09 21:30:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:28,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:28,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:28,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-01-09 21:30:28,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 528 transitions, 1281 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:28,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:28,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-01-09 21:30:28,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:28,277 INFO L124 PetriNetUnfolderBase]: 107/1753 cut-off events. [2025-01-09 21:30:28,278 INFO L125 PetriNetUnfolderBase]: For 99/121 co-relation queries the response was YES. [2025-01-09 21:30:28,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 1753 events. 107/1753 cut-off events. For 99/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9631 event pairs, 21 based on Foata normal form. 1/1693 useless extension candidates. Maximal degree in co-relation 2197. Up to 71 conditions per place. [2025-01-09 21:30:28,292 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 0 selfloop transitions, 0 changer transitions 529/529 dead transitions. [2025-01-09 21:30:28,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 529 transitions, 1309 flow [2025-01-09 21:30:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-01-09 21:30:28,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-01-09 21:30:28,293 INFO L175 Difference]: Start difference. First operand has 563 places, 528 transitions, 1281 flow. Second operand 3 states and 1801 transitions. [2025-01-09 21:30:28,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 529 transitions, 1309 flow [2025-01-09 21:30:28,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 529 transitions, 1267 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-01-09 21:30:28,298 INFO L231 Difference]: Finished difference. Result has 544 places, 0 transitions, 0 flow [2025-01-09 21:30:28,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=544, PETRI_TRANSITIONS=0} [2025-01-09 21:30:28,298 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -43 predicate places. [2025-01-09 21:30:28,299 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 0 transitions, 0 flow [2025-01-09 21:30:28,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (103 of 104 remaining) [2025-01-09 21:30:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (102 of 104 remaining) [2025-01-09 21:30:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (101 of 104 remaining) [2025-01-09 21:30:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (100 of 104 remaining) [2025-01-09 21:30:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (99 of 104 remaining) [2025-01-09 21:30:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (98 of 104 remaining) [2025-01-09 21:30:28,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (97 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (96 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (95 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (94 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (93 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (92 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (91 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (89 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (88 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (87 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (86 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (85 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (84 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (83 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (82 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (81 of 104 remaining) [2025-01-09 21:30:28,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (80 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (79 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (78 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (77 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (76 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (75 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (74 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (73 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (72 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (71 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (70 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (69 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (68 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (67 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (66 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (65 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (64 of 104 remaining) [2025-01-09 21:30:28,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (63 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (62 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (61 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (60 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (59 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (58 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (57 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (56 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (55 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (54 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (53 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (52 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (50 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (49 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (48 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (47 of 104 remaining) [2025-01-09 21:30:28,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (46 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (45 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 104 remaining) [2025-01-09 21:30:28,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 104 remaining) [2025-01-09 21:30:28,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 104 remaining) [2025-01-09 21:30:28,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 104 remaining) [2025-01-09 21:30:28,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:30:28,308 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:28,311 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:28,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:28,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:28 BasicIcfg [2025-01-09 21:30:28,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:28,315 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:28,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:28,315 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:28,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:55" (3/4) ... [2025-01-09 21:30:28,316 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:28,318 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:28,319 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:28,319 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:28,322 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-01-09 21:30:28,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:28,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:28,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:28,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:28,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:28,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:28,384 INFO L158 Benchmark]: Toolchain (without parser) took 33432.73ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 110.8MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 21:30:28,385 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:28,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.15ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 96.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:30:28,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.05ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:28,386 INFO L158 Benchmark]: Boogie Preprocessor took 38.07ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:28,386 INFO L158 Benchmark]: RCFGBuilder took 675.45ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 43.9MB in the end (delta: 45.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 21:30:28,386 INFO L158 Benchmark]: TraceAbstraction took 32418.94ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 43.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 21:30:28,387 INFO L158 Benchmark]: Witness Printer took 68.23ms. Allocated memory is still 3.5GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:28,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.15ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 96.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.05ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.07ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 675.45ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 43.9MB in the end (delta: 45.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32418.94ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 43.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 68.23ms. Allocated memory is still 3.5GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 932 locations, 104 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.2s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6758 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4321 mSDsluCounter, 7290 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6807 mSDsCounter, 1289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10752 IncrementalHoareTripleChecker+Invalid, 12041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1289 mSolverCounterUnsat, 483 mSDtfsCounter, 10752 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1662occurred in iteration=24, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 6303 NumberOfCodeBlocks, 6303 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6266 ConstructedInterpolants, 0 QuantifiedInterpolants, 8590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 31/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 59 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:28,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE