./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:37:25,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:37:25,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:37:25,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:37:25,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:37:25,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:37:25,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:37:25,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:37:25,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:37:25,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:37:25,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:37:25,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:37:25,632 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:37:25,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:37:25,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:37:25,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:25,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:37:25,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:37:25,634 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/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 -> a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df [2025-03-14 01:37:25,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:37:25,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:37:25,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:37:25,848 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:37:25,849 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:37:25,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2025-03-14 01:37:26,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe5041da/76d9d7dedee44548b0b76e4e1e95b5af/FLAGeadc284ad [2025-03-14 01:37:27,309 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:37:27,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2025-03-14 01:37:27,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe5041da/76d9d7dedee44548b0b76e4e1e95b5af/FLAGeadc284ad [2025-03-14 01:37:27,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe5041da/76d9d7dedee44548b0b76e4e1e95b5af [2025-03-14 01:37:27,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:37:27,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:37:27,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:27,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:37:27,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:37:27,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3800c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27, skipping insertion in model container [2025-03-14 01:37:27,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:37:27,638 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:27,638 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:27,639 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:27,639 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:27,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:27,697 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:37:27,731 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:27,732 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:27,732 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:27,733 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:27,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:27,792 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:37:27,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27 WrapperNode [2025-03-14 01:37:27,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:27,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:27,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:37:27,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:37:27,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,836 INFO L138 Inliner]: procedures = 274, calls = 98, calls flagged for inlining = 9, calls inlined = 8, statements flattened = 270 [2025-03-14 01:37:27,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:27,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:37:27,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:37:27,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:37:27,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:37:27,874 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:37:27,874 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:37:27,874 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:37:27,875 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (1/1) ... [2025-03-14 01:37:27,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:27,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:27,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:37:27,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:37:27,915 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-14 01:37:27,916 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:37:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:37:27,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:37:27,917 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:37:28,038 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:37:28,040 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:37:28,499 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:37:28,501 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:37:28,501 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:37:28,533 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:37:28,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:28 BoogieIcfgContainer [2025-03-14 01:37:28,536 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:37:28,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:37:28,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:37:28,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:37:28,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:37:27" (1/3) ... [2025-03-14 01:37:28,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c8c386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:28, skipping insertion in model container [2025-03-14 01:37:28,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:27" (2/3) ... [2025-03-14 01:37:28,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c8c386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:28, skipping insertion in model container [2025-03-14 01:37:28,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:28" (3/3) ... [2025-03-14 01:37:28,542 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_22-nocollapse.i [2025-03-14 01:37:28,553 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:37:28,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_22-nocollapse.i that has 2 procedures, 305 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-03-14 01:37:28,559 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:37:28,657 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:37:28,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 379 transitions, 766 flow [2025-03-14 01:37:28,830 INFO L124 PetriNetUnfolderBase]: 9/377 cut-off events. [2025-03-14 01:37:28,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:28,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 377 events. 9/377 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 606 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 304. Up to 2 conditions per place. [2025-03-14 01:37:28,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 379 transitions, 766 flow [2025-03-14 01:37:28,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 760 flow [2025-03-14 01:37:28,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:37:28,857 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;@145d80b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:37:28,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-14 01:37:28,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:37:28,874 INFO L124 PetriNetUnfolderBase]: 1/115 cut-off events. [2025-03-14 01:37:28,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:28,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:28,875 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] [2025-03-14 01:37:28,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:28,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1391034647, now seen corresponding path program 1 times [2025-03-14 01:37:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431817008] [2025-03-14 01:37:28,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:28,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-14 01:37:29,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-14 01:37:29,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:29,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431817008] [2025-03-14 01:37:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431817008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:29,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:29,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928227831] [2025-03-14 01:37:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:29,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:29,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:29,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:29,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:30,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 379 [2025-03-14 01:37:30,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 0 states have call successors, (0), 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-03-14 01:37:30,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:30,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 379 [2025-03-14 01:37:30,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:30,561 INFO L124 PetriNetUnfolderBase]: 449/1850 cut-off events. [2025-03-14 01:37:30,561 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:37:30,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 1850 events. 449/1850 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11513 event pairs, 342 based on Foata normal form. 35/1677 useless extension candidates. Maximal degree in co-relation 2472. Up to 846 conditions per place. [2025-03-14 01:37:30,577 INFO L140 encePairwiseOnDemand]: 364/379 looper letters, 72 selfloop transitions, 10 changer transitions 1/372 dead transitions. [2025-03-14 01:37:30,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 372 transitions, 914 flow [2025-03-14 01:37:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1839 transitions. [2025-03-14 01:37:30,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8087071240105541 [2025-03-14 01:37:30,598 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 760 flow. Second operand 6 states and 1839 transitions. [2025-03-14 01:37:30,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 372 transitions, 914 flow [2025-03-14 01:37:30,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 372 transitions, 912 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:37:30,610 INFO L231 Difference]: Finished difference. Result has 376 places, 371 transitions, 766 flow [2025-03-14 01:37:30,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=376, PETRI_TRANSITIONS=371} [2025-03-14 01:37:30,616 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 1 predicate places. [2025-03-14 01:37:30,616 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 371 transitions, 766 flow [2025-03-14 01:37:30,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 0 states have call successors, (0), 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-03-14 01:37:30,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:30,618 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] [2025-03-14 01:37:30,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:37:30,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:30,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 570931479, now seen corresponding path program 1 times [2025-03-14 01:37:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:30,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689811121] [2025-03-14 01:37:30,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:30,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-14 01:37:30,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-14 01:37:30,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:30,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:31,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:31,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689811121] [2025-03-14 01:37:31,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689811121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:31,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:31,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:31,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113533062] [2025-03-14 01:37:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:31,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:31,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:31,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:31,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:31,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 379 [2025-03-14 01:37:31,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 371 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 0 states have call successors, (0), 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-03-14 01:37:31,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:31,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 379 [2025-03-14 01:37:31,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:31,723 INFO L124 PetriNetUnfolderBase]: 449/1847 cut-off events. [2025-03-14 01:37:31,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:31,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1847 events. 449/1847 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11494 event pairs, 342 based on Foata normal form. 0/1642 useless extension candidates. Maximal degree in co-relation 2581. Up to 846 conditions per place. [2025-03-14 01:37:31,732 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 72 selfloop transitions, 10 changer transitions 0/369 dead transitions. [2025-03-14 01:37:31,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 369 transitions, 926 flow [2025-03-14 01:37:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1836 transitions. [2025-03-14 01:37:31,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8073878627968337 [2025-03-14 01:37:31,735 INFO L175 Difference]: Start difference. First operand has 376 places, 371 transitions, 766 flow. Second operand 6 states and 1836 transitions. [2025-03-14 01:37:31,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 369 transitions, 926 flow [2025-03-14 01:37:31,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 369 transitions, 906 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:31,756 INFO L231 Difference]: Finished difference. Result has 373 places, 369 transitions, 762 flow [2025-03-14 01:37:31,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=762, PETRI_PLACES=373, PETRI_TRANSITIONS=369} [2025-03-14 01:37:31,759 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-03-14 01:37:31,759 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 369 transitions, 762 flow [2025-03-14 01:37:31,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 0 states have call successors, (0), 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-03-14 01:37:31,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:31,760 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] [2025-03-14 01:37:31,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:37:31,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:31,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1698838141, now seen corresponding path program 1 times [2025-03-14 01:37:31,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:31,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730468462] [2025-03-14 01:37:31,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:31,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-14 01:37:31,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-14 01:37:31,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:31,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:31,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-03-14 01:37:31,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:31,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730468462] [2025-03-14 01:37:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730468462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244524491] [2025-03-14 01:37:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:31,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:31,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:31,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 379 [2025-03-14 01:37:31,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 369 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 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-03-14 01:37:31,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:31,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 379 [2025-03-14 01:37:31,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:31,918 INFO L124 PetriNetUnfolderBase]: 29/671 cut-off events. [2025-03-14 01:37:31,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:31,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 671 events. 29/671 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2434 event pairs, 18 based on Foata normal form. 1/620 useless extension candidates. Maximal degree in co-relation 435. Up to 45 conditions per place. [2025-03-14 01:37:31,921 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-14 01:37:31,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 370 transitions, 790 flow [2025-03-14 01:37:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-03-14 01:37:31,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9727352682497801 [2025-03-14 01:37:31,924 INFO L175 Difference]: Start difference. First operand has 373 places, 369 transitions, 762 flow. Second operand 3 states and 1106 transitions. [2025-03-14 01:37:31,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 370 transitions, 790 flow [2025-03-14 01:37:31,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 770 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:31,930 INFO L231 Difference]: Finished difference. Result has 371 places, 370 transitions, 754 flow [2025-03-14 01:37:31,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=371, PETRI_TRANSITIONS=370} [2025-03-14 01:37:31,932 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -4 predicate places. [2025-03-14 01:37:31,932 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 370 transitions, 754 flow [2025-03-14 01:37:31,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 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-03-14 01:37:31,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:31,933 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] [2025-03-14 01:37:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:37:31,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2060271083, now seen corresponding path program 1 times [2025-03-14 01:37:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408848563] [2025-03-14 01:37:31,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:31,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-14 01:37:31,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-14 01:37:31,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:31,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:32,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:32,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408848563] [2025-03-14 01:37:32,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408848563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:32,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:32,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:32,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306082805] [2025-03-14 01:37:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:32,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:32,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:32,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:32,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:32,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 379 [2025-03-14 01:37:32,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 370 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 0 states have call successors, (0), 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-03-14 01:37:32,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:32,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 379 [2025-03-14 01:37:32,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:32,906 INFO L124 PetriNetUnfolderBase]: 450/1969 cut-off events. [2025-03-14 01:37:32,906 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:37:32,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 1969 events. 450/1969 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12249 event pairs, 342 based on Foata normal form. 0/1760 useless extension candidates. Maximal degree in co-relation 2655. Up to 894 conditions per place. [2025-03-14 01:37:32,913 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 79 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-03-14 01:37:32,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 369 transitions, 920 flow [2025-03-14 01:37:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1831 transitions. [2025-03-14 01:37:32,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051890941072999 [2025-03-14 01:37:32,918 INFO L175 Difference]: Start difference. First operand has 371 places, 370 transitions, 754 flow. Second operand 6 states and 1831 transitions. [2025-03-14 01:37:32,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 369 transitions, 920 flow [2025-03-14 01:37:32,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 369 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:32,922 INFO L231 Difference]: Finished difference. Result has 374 places, 369 transitions, 760 flow [2025-03-14 01:37:32,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=374, PETRI_TRANSITIONS=369} [2025-03-14 01:37:32,923 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-03-14 01:37:32,923 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 369 transitions, 760 flow [2025-03-14 01:37:32,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 0 states have call successors, (0), 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-03-14 01:37:32,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:32,924 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] [2025-03-14 01:37:32,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:37:32,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:32,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1573498170, now seen corresponding path program 1 times [2025-03-14 01:37:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:32,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862783644] [2025-03-14 01:37:32,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:32,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-14 01:37:32,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-14 01:37:32,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:32,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:32,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:32,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862783644] [2025-03-14 01:37:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862783644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:32,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554712890] [2025-03-14 01:37:32,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:32,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:32,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:32,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:33,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 379 [2025-03-14 01:37:33,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 369 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 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-03-14 01:37:33,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:33,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 379 [2025-03-14 01:37:33,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:33,075 INFO L124 PetriNetUnfolderBase]: 29/857 cut-off events. [2025-03-14 01:37:33,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:33,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 857 events. 29/857 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2429 event pairs, 18 based on Foata normal form. 2/801 useless extension candidates. Maximal degree in co-relation 513. Up to 49 conditions per place. [2025-03-14 01:37:33,078 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-14 01:37:33,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 370 transitions, 788 flow [2025-03-14 01:37:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-03-14 01:37:33,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9727352682497801 [2025-03-14 01:37:33,081 INFO L175 Difference]: Start difference. First operand has 374 places, 369 transitions, 760 flow. Second operand 3 states and 1106 transitions. [2025-03-14 01:37:33,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 370 transitions, 788 flow [2025-03-14 01:37:33,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 370 transitions, 778 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:33,085 INFO L231 Difference]: Finished difference. Result has 372 places, 370 transitions, 762 flow [2025-03-14 01:37:33,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=372, PETRI_TRANSITIONS=370} [2025-03-14 01:37:33,086 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-03-14 01:37:33,086 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 370 transitions, 762 flow [2025-03-14 01:37:33,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 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-03-14 01:37:33,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:33,086 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] [2025-03-14 01:37:33,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:37:33,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:33,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash -231714112, now seen corresponding path program 1 times [2025-03-14 01:37:33,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:33,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427863015] [2025-03-14 01:37:33,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:33,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-14 01:37:33,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-14 01:37:33,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:33,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:33,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:33,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427863015] [2025-03-14 01:37:33,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427863015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:33,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:33,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114420456] [2025-03-14 01:37:33,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:33,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:33,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:33,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:33,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-03-14 01:37:33,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 370 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 320.5) internal successors, (1923), 6 states have internal predecessors, (1923), 0 states have call successors, (0), 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-03-14 01:37:33,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:33,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-03-14 01:37:33,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:34,043 INFO L124 PetriNetUnfolderBase]: 75/1169 cut-off events. [2025-03-14 01:37:34,043 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:37:34,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 1169 events. 75/1169 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4612 event pairs, 42 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 953. Up to 263 conditions per place. [2025-03-14 01:37:34,047 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 54 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-03-14 01:37:34,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 369 transitions, 878 flow [2025-03-14 01:37:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1956 transitions. [2025-03-14 01:37:34,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8601583113456465 [2025-03-14 01:37:34,052 INFO L175 Difference]: Start difference. First operand has 372 places, 370 transitions, 762 flow. Second operand 6 states and 1956 transitions. [2025-03-14 01:37:34,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 369 transitions, 878 flow [2025-03-14 01:37:34,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 369 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:34,056 INFO L231 Difference]: Finished difference. Result has 375 places, 369 transitions, 768 flow [2025-03-14 01:37:34,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=768, PETRI_PLACES=375, PETRI_TRANSITIONS=369} [2025-03-14 01:37:34,057 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 0 predicate places. [2025-03-14 01:37:34,057 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 369 transitions, 768 flow [2025-03-14 01:37:34,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.5) internal successors, (1923), 6 states have internal predecessors, (1923), 0 states have call successors, (0), 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-03-14 01:37:34,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:34,058 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] [2025-03-14 01:37:34,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:37:34,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:34,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:34,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1484926838, now seen corresponding path program 1 times [2025-03-14 01:37:34,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:34,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743242134] [2025-03-14 01:37:34,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:34,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:34,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-14 01:37:34,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-14 01:37:34,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:34,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:34,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:34,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743242134] [2025-03-14 01:37:34,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743242134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:34,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:34,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:34,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203600801] [2025-03-14 01:37:34,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:34,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:34,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:34,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:34,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:34,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 379 [2025-03-14 01:37:34,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 369 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 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-03-14 01:37:34,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:34,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 379 [2025-03-14 01:37:34,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:34,993 INFO L124 PetriNetUnfolderBase]: 450/2149 cut-off events. [2025-03-14 01:37:34,994 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:34,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2149 events. 450/2149 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12273 event pairs, 342 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 2698. Up to 960 conditions per place. [2025-03-14 01:37:35,003 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 79 selfloop transitions, 5 changer transitions 0/368 dead transitions. [2025-03-14 01:37:35,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 368 transitions, 934 flow [2025-03-14 01:37:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1831 transitions. [2025-03-14 01:37:35,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051890941072999 [2025-03-14 01:37:35,008 INFO L175 Difference]: Start difference. First operand has 375 places, 369 transitions, 768 flow. Second operand 6 states and 1831 transitions. [2025-03-14 01:37:35,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 368 transitions, 934 flow [2025-03-14 01:37:35,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 368 transitions, 924 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:35,014 INFO L231 Difference]: Finished difference. Result has 374 places, 368 transitions, 766 flow [2025-03-14 01:37:35,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=374, PETRI_TRANSITIONS=368} [2025-03-14 01:37:35,015 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-03-14 01:37:35,015 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 368 transitions, 766 flow [2025-03-14 01:37:35,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 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-03-14 01:37:35,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:35,016 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] [2025-03-14 01:37:35,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:37:35,016 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:35,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1289711983, now seen corresponding path program 1 times [2025-03-14 01:37:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:35,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608091138] [2025-03-14 01:37:35,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:35,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-14 01:37:35,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-14 01:37:35,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:35,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:35,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608091138] [2025-03-14 01:37:35,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608091138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:35,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:35,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368535120] [2025-03-14 01:37:35,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:35,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:35,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:35,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:35,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 379 [2025-03-14 01:37:35,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 368 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 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-03-14 01:37:35,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:35,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 379 [2025-03-14 01:37:35,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:35,861 INFO L124 PetriNetUnfolderBase]: 450/2145 cut-off events. [2025-03-14 01:37:35,861 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:35,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 2145 events. 450/2145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12281 event pairs, 342 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 2714. Up to 944 conditions per place. [2025-03-14 01:37:35,870 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 75 selfloop transitions, 5 changer transitions 0/367 dead transitions. [2025-03-14 01:37:35,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 367 transitions, 924 flow [2025-03-14 01:37:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1851 transitions. [2025-03-14 01:37:35,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139841688654353 [2025-03-14 01:37:35,874 INFO L175 Difference]: Start difference. First operand has 374 places, 368 transitions, 766 flow. Second operand 6 states and 1851 transitions. [2025-03-14 01:37:35,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 367 transitions, 924 flow [2025-03-14 01:37:35,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 367 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:35,878 INFO L231 Difference]: Finished difference. Result has 373 places, 367 transitions, 764 flow [2025-03-14 01:37:35,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=373, PETRI_TRANSITIONS=367} [2025-03-14 01:37:35,878 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-03-14 01:37:35,879 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 367 transitions, 764 flow [2025-03-14 01:37:35,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 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-03-14 01:37:35,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:35,880 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-03-14 01:37:35,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:37:35,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:35,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1090537409, now seen corresponding path program 1 times [2025-03-14 01:37:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:35,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120057442] [2025-03-14 01:37:35,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:35,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:35,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-14 01:37:35,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-14 01:37:35,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:35,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:37:36,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120057442] [2025-03-14 01:37:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120057442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:36,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:36,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45011475] [2025-03-14 01:37:36,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:36,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:36,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:36,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:36,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:36,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 379 [2025-03-14 01:37:36,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 367 transitions, 764 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 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-03-14 01:37:36,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:36,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 379 [2025-03-14 01:37:36,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:36,782 INFO L124 PetriNetUnfolderBase]: 450/2141 cut-off events. [2025-03-14 01:37:36,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:36,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 2141 events. 450/2141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12209 event pairs, 342 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 2729. Up to 944 conditions per place. [2025-03-14 01:37:36,791 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 75 selfloop transitions, 5 changer transitions 0/366 dead transitions. [2025-03-14 01:37:36,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 366 transitions, 922 flow [2025-03-14 01:37:36,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1851 transitions. [2025-03-14 01:37:36,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139841688654353 [2025-03-14 01:37:36,795 INFO L175 Difference]: Start difference. First operand has 373 places, 367 transitions, 764 flow. Second operand 6 states and 1851 transitions. [2025-03-14 01:37:36,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 366 transitions, 922 flow [2025-03-14 01:37:36,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 366 transitions, 912 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:36,799 INFO L231 Difference]: Finished difference. Result has 372 places, 366 transitions, 762 flow [2025-03-14 01:37:36,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=762, PETRI_PLACES=372, PETRI_TRANSITIONS=366} [2025-03-14 01:37:36,800 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-03-14 01:37:36,800 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 366 transitions, 762 flow [2025-03-14 01:37:36,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 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-03-14 01:37:36,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:36,801 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] [2025-03-14 01:37:36,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:37:36,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:36,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash 682887699, now seen corresponding path program 1 times [2025-03-14 01:37:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:36,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338166126] [2025-03-14 01:37:36,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:36,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:36,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-14 01:37:36,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-14 01:37:36,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:36,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:37:37,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:37,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338166126] [2025-03-14 01:37:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338166126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:37,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399831035] [2025-03-14 01:37:37,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:37,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:37,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:37,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:37,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:37,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 379 [2025-03-14 01:37:37,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 366 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 0 states have call successors, (0), 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-03-14 01:37:37,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:37,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 379 [2025-03-14 01:37:37,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:37,785 INFO L124 PetriNetUnfolderBase]: 450/2137 cut-off events. [2025-03-14 01:37:37,786 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:37,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 2137 events. 450/2137 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12189 event pairs, 342 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 2742. Up to 964 conditions per place. [2025-03-14 01:37:37,793 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 80 selfloop transitions, 5 changer transitions 0/365 dead transitions. [2025-03-14 01:37:37,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 365 transitions, 930 flow [2025-03-14 01:37:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1826 transitions. [2025-03-14 01:37:37,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.802990325417766 [2025-03-14 01:37:37,796 INFO L175 Difference]: Start difference. First operand has 372 places, 366 transitions, 762 flow. Second operand 6 states and 1826 transitions. [2025-03-14 01:37:37,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 365 transitions, 930 flow [2025-03-14 01:37:37,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 365 transitions, 920 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:37,801 INFO L231 Difference]: Finished difference. Result has 371 places, 365 transitions, 760 flow [2025-03-14 01:37:37,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=371, PETRI_TRANSITIONS=365} [2025-03-14 01:37:37,803 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -4 predicate places. [2025-03-14 01:37:37,803 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 365 transitions, 760 flow [2025-03-14 01:37:37,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 0 states have call successors, (0), 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-03-14 01:37:37,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:37,804 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] [2025-03-14 01:37:37,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:37:37,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:37,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2049295721, now seen corresponding path program 1 times [2025-03-14 01:37:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007795044] [2025-03-14 01:37:37,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:37,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-14 01:37:37,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-14 01:37:37,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:37,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-14 01:37:37,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007795044] [2025-03-14 01:37:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007795044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938718895] [2025-03-14 01:37:37,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:37,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:37,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:37,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:37,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:37:38,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-14 01:37:38,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-14 01:37:38,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:38,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:37:38,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-14 01:37:38,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-14 01:37:38,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938718895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:38,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:38,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:37:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982141332] [2025-03-14 01:37:38,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:38,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:37:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:38,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:37:38,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:37:38,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-03-14 01:37:38,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 365 transitions, 760 flow. Second operand has 10 states, 10 states have (on average 363.0) internal successors, (3630), 10 states have internal predecessors, (3630), 0 states have call successors, (0), 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-03-14 01:37:38,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:38,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-03-14 01:37:38,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:38,583 INFO L124 PetriNetUnfolderBase]: 29/1021 cut-off events. [2025-03-14 01:37:38,583 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:37:38,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 1021 events. 29/1021 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1822 event pairs, 18 based on Foata normal form. 4/987 useless extension candidates. Maximal degree in co-relation 506. Up to 49 conditions per place. [2025-03-14 01:37:38,585 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 15 selfloop transitions, 9 changer transitions 0/373 dead transitions. [2025-03-14 01:37:38,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 373 transitions, 826 flow [2025-03-14 01:37:38,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:37:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:37:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3275 transitions. [2025-03-14 01:37:38,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601289944297859 [2025-03-14 01:37:38,590 INFO L175 Difference]: Start difference. First operand has 371 places, 365 transitions, 760 flow. Second operand 9 states and 3275 transitions. [2025-03-14 01:37:38,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 373 transitions, 826 flow [2025-03-14 01:37:38,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 373 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:38,594 INFO L231 Difference]: Finished difference. Result has 377 places, 371 transitions, 800 flow [2025-03-14 01:37:38,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=800, PETRI_PLACES=377, PETRI_TRANSITIONS=371} [2025-03-14 01:37:38,595 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 2 predicate places. [2025-03-14 01:37:38,595 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 371 transitions, 800 flow [2025-03-14 01:37:38,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 363.0) internal successors, (3630), 10 states have internal predecessors, (3630), 0 states have call successors, (0), 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-03-14 01:37:38,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:38,597 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:37:38,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:37:38,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-14 01:37:38,798 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:38,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2054178937, now seen corresponding path program 2 times [2025-03-14 01:37:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:38,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850174605] [2025-03-14 01:37:38,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:38,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 420 statements into 2 equivalence classes. [2025-03-14 01:37:38,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 121 of 420 statements. [2025-03-14 01:37:38,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:38,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-03-14 01:37:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850174605] [2025-03-14 01:37:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850174605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:39,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:39,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:39,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081972063] [2025-03-14 01:37:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:39,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:39,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:39,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:39,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 379 [2025-03-14 01:37:39,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 371 transitions, 800 flow. Second operand has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 0 states have call successors, (0), 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-03-14 01:37:39,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:39,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 379 [2025-03-14 01:37:39,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:40,078 INFO L124 PetriNetUnfolderBase]: 199/1922 cut-off events. [2025-03-14 01:37:40,078 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:37:40,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 1922 events. 199/1922 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8801 event pairs, 54 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 1891. Up to 448 conditions per place. [2025-03-14 01:37:40,088 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 71 selfloop transitions, 23 changer transitions 0/406 dead transitions. [2025-03-14 01:37:40,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 406 transitions, 1066 flow [2025-03-14 01:37:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1997 transitions. [2025-03-14 01:37:40,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781882145998241 [2025-03-14 01:37:40,091 INFO L175 Difference]: Start difference. First operand has 377 places, 371 transitions, 800 flow. Second operand 6 states and 1997 transitions. [2025-03-14 01:37:40,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 406 transitions, 1066 flow [2025-03-14 01:37:40,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 406 transitions, 1060 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:40,096 INFO L231 Difference]: Finished difference. Result has 386 places, 393 transitions, 952 flow [2025-03-14 01:37:40,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=386, PETRI_TRANSITIONS=393} [2025-03-14 01:37:40,098 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 11 predicate places. [2025-03-14 01:37:40,098 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 393 transitions, 952 flow [2025-03-14 01:37:40,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 0 states have call successors, (0), 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-03-14 01:37:40,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:40,099 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:37:40,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:37:40,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:40,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1381722651, now seen corresponding path program 1 times [2025-03-14 01:37:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:40,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957120018] [2025-03-14 01:37:40,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:40,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:40,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-14 01:37:40,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-14 01:37:40,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-14 01:37:40,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:40,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957120018] [2025-03-14 01:37:40,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957120018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920290711] [2025-03-14 01:37:40,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:40,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:40,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:40,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:40,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:37:40,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-14 01:37:40,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-14 01:37:40,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:40,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:40,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:37:40,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-14 01:37:40,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-14 01:37:41,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920290711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:41,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:41,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-14 01:37:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683309648] [2025-03-14 01:37:41,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:41,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:37:41,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:41,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:37:41,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:37:41,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 379 [2025-03-14 01:37:41,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 393 transitions, 952 flow. Second operand has 19 states, 19 states have (on average 357.6842105263158) internal successors, (6796), 19 states have internal predecessors, (6796), 0 states have call successors, (0), 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-03-14 01:37:41,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:41,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 379 [2025-03-14 01:37:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:42,564 INFO L124 PetriNetUnfolderBase]: 186/3460 cut-off events. [2025-03-14 01:37:42,564 INFO L125 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2025-03-14 01:37:42,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4184 conditions, 3460 events. 186/3460 cut-off events. For 134/138 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9484 event pairs, 55 based on Foata normal form. 13/3304 useless extension candidates. Maximal degree in co-relation 2868. Up to 146 conditions per place. [2025-03-14 01:37:42,571 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 47 selfloop transitions, 68 changer transitions 0/479 dead transitions. [2025-03-14 01:37:42,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 479 transitions, 1592 flow [2025-03-14 01:37:42,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-14 01:37:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-14 01:37:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 22493 transitions. [2025-03-14 01:37:42,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420362692130502 [2025-03-14 01:37:42,587 INFO L175 Difference]: Start difference. First operand has 386 places, 393 transitions, 952 flow. Second operand 63 states and 22493 transitions. [2025-03-14 01:37:42,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 479 transitions, 1592 flow [2025-03-14 01:37:42,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 479 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:42,593 INFO L231 Difference]: Finished difference. Result has 464 places, 455 transitions, 1472 flow [2025-03-14 01:37:42,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1472, PETRI_PLACES=464, PETRI_TRANSITIONS=455} [2025-03-14 01:37:42,594 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 89 predicate places. [2025-03-14 01:37:42,594 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 455 transitions, 1472 flow [2025-03-14 01:37:42,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 357.6842105263158) internal successors, (6796), 19 states have internal predecessors, (6796), 0 states have call successors, (0), 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-03-14 01:37:42,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:42,596 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:37:42,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:37:42,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 01:37:42,797 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:42,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1003277599, now seen corresponding path program 2 times [2025-03-14 01:37:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:42,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312209059] [2025-03-14 01:37:42,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:42,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1445 statements into 2 equivalence classes. [2025-03-14 01:37:42,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 127 of 1445 statements. [2025-03-14 01:37:42,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:42,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15305 trivial. 0 not checked. [2025-03-14 01:37:43,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:43,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312209059] [2025-03-14 01:37:43,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312209059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:43,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:43,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:43,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109219084] [2025-03-14 01:37:43,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:43,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:43,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:43,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:43,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:43,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 379 [2025-03-14 01:37:43,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 455 transitions, 1472 flow. Second operand has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 0 states have call successors, (0), 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-03-14 01:37:43,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:43,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 379 [2025-03-14 01:37:43,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:44,984 INFO L124 PetriNetUnfolderBase]: 311/4016 cut-off events. [2025-03-14 01:37:44,985 INFO L125 PetriNetUnfolderBase]: For 710/744 co-relation queries the response was YES. [2025-03-14 01:37:44,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 4016 events. 311/4016 cut-off events. For 710/744 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15626 event pairs, 61 based on Foata normal form. 8/3810 useless extension candidates. Maximal degree in co-relation 3815. Up to 1009 conditions per place. [2025-03-14 01:37:44,995 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 84 selfloop transitions, 31 changer transitions 0/494 dead transitions. [2025-03-14 01:37:44,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 494 transitions, 1822 flow [2025-03-14 01:37:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2025-03-14 01:37:44,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876429199648197 [2025-03-14 01:37:44,997 INFO L175 Difference]: Start difference. First operand has 464 places, 455 transitions, 1472 flow. Second operand 6 states and 1993 transitions. [2025-03-14 01:37:44,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 494 transitions, 1822 flow [2025-03-14 01:37:45,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 494 transitions, 1746 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-14 01:37:45,009 INFO L231 Difference]: Finished difference. Result has 467 places, 485 transitions, 1654 flow [2025-03-14 01:37:45,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1654, PETRI_PLACES=467, PETRI_TRANSITIONS=485} [2025-03-14 01:37:45,010 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 92 predicate places. [2025-03-14 01:37:45,010 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 485 transitions, 1654 flow [2025-03-14 01:37:45,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 0 states have call successors, (0), 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-03-14 01:37:45,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:45,015 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:37:45,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:37:45,015 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:45,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:45,020 INFO L85 PathProgramCache]: Analyzing trace with hash -365938043, now seen corresponding path program 1 times [2025-03-14 01:37:45,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:45,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151355383] [2025-03-14 01:37:45,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:45,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:45,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-03-14 01:37:45,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-03-14 01:37:45,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:45,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-14 01:37:47,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151355383] [2025-03-14 01:37:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151355383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565174483] [2025-03-14 01:37:47,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:47,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:47,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:47,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:47,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:37:47,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-03-14 01:37:48,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-03-14 01:37:48,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:48,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:48,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 5678 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:37:48,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-14 01:37:48,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-14 01:37:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565174483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:49,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:49,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-14 01:37:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455888538] [2025-03-14 01:37:49,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:49,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 01:37:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:49,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 01:37:49,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 01:37:49,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-03-14 01:37:49,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 485 transitions, 1654 flow. Second operand has 34 states, 34 states have (on average 363.1764705882353) internal successors, (12348), 34 states have internal predecessors, (12348), 0 states have call successors, (0), 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-03-14 01:37:49,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:49,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-03-14 01:37:49,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:51,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L1044-3-->L1044: Formula: (and (= |v_fThread1of1ForFork1_#t~ret20#1_1| 0) (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#c~0.base_93| (store (select |v_#pthreadsMutex_20| |v_~#c~0.base_93|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_93| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_93|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_20|, ~#c~0.offset=|v_~#c~0.offset_93|} OutVars{~#c~0.base=|v_~#c~0.base_93|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_19|, fThread1of1ForFork1_#t~ret20#1=|v_fThread1of1ForFork1_#t~ret20#1_1|, ~#c~0.offset=|v_~#c~0.offset_93|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret20#1][421], [436#true, 376#true, Black: 394#(= |ULTIMATE.start_main_~i~0#1| 0), 4591#true, 1891#true, Black: 404#(= |ULTIMATE.start_main_~j~1#1| 0), 4602#true, 264#ULTIMATE.startFINALtrue, 121#L1044true, Black: 3315#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 440#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 4502#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 4508#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), Black: 1268#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 1906#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 3598#(< |ULTIMATE.start_main_~j~1#1| 28), 378#true, Black: 3062#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 4512#(and (= 0 |ULTIMATE.start_main_#t~post25#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4496#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 4538#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3326#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 1904#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1894#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4544#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4490#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 1895#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1893#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 1896#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4532#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4550#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4594#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 1902#true, Black: 4593#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), 372#L1044true, Black: 4596#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 4595#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0))]) [2025-03-14 01:37:51,507 INFO L294 olderBase$Statistics]: this new event has 2977 ancestors and is cut-off event [2025-03-14 01:37:51,507 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-03-14 01:37:51,507 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-03-14 01:37:51,507 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-03-14 01:37:52,309 INFO L124 PetriNetUnfolderBase]: 340/6486 cut-off events. [2025-03-14 01:37:52,309 INFO L125 PetriNetUnfolderBase]: For 3587/3605 co-relation queries the response was YES. [2025-03-14 01:37:52,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8384 conditions, 6486 events. 340/6486 cut-off events. For 3587/3605 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17975 event pairs, 100 based on Foata normal form. 30/6248 useless extension candidates. Maximal degree in co-relation 5734. Up to 259 conditions per place. [2025-03-14 01:37:52,324 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 47 selfloop transitions, 135 changer transitions 0/586 dead transitions. [2025-03-14 01:37:52,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 586 transitions, 2782 flow [2025-03-14 01:37:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 01:37:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 01:37:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16325 transitions. [2025-03-14 01:37:52,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571973028437408 [2025-03-14 01:37:52,332 INFO L175 Difference]: Start difference. First operand has 467 places, 485 transitions, 1654 flow. Second operand 45 states and 16325 transitions. [2025-03-14 01:37:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 586 transitions, 2782 flow [2025-03-14 01:37:52,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 586 transitions, 2782 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:52,345 INFO L231 Difference]: Finished difference. Result has 520 places, 560 transitions, 2528 flow [2025-03-14 01:37:52,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2528, PETRI_PLACES=520, PETRI_TRANSITIONS=560} [2025-03-14 01:37:52,346 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 145 predicate places. [2025-03-14 01:37:52,346 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 560 transitions, 2528 flow [2025-03-14 01:37:52,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 363.1764705882353) internal successors, (12348), 34 states have internal predecessors, (12348), 0 states have call successors, (0), 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-03-14 01:37:52,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:52,350 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:37:52,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:37:52,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:52,551 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:52,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1136915067, now seen corresponding path program 2 times [2025-03-14 01:37:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:52,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588008925] [2025-03-14 01:37:52,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:52,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2889 statements into 2 equivalence classes. [2025-03-14 01:37:52,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 131 of 2889 statements. [2025-03-14 01:37:52,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71641 trivial. 0 not checked. [2025-03-14 01:37:53,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:53,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588008925] [2025-03-14 01:37:53,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588008925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:53,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:53,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216731484] [2025-03-14 01:37:53,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:53,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:53,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:53,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:53,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:53,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-03-14 01:37:53,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 560 transitions, 2528 flow. Second operand has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 0 states have call successors, (0), 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-03-14 01:37:53,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:53,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-03-14 01:37:53,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:56,374 INFO L124 PetriNetUnfolderBase]: 457/6746 cut-off events. [2025-03-14 01:37:56,374 INFO L125 PetriNetUnfolderBase]: For 2378/2470 co-relation queries the response was YES. [2025-03-14 01:37:56,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10692 conditions, 6746 events. 457/6746 cut-off events. For 2378/2470 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21240 event pairs, 87 based on Foata normal form. 34/6549 useless extension candidates. Maximal degree in co-relation 7275. Up to 1847 conditions per place. [2025-03-14 01:37:56,393 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 108 selfloop transitions, 55 changer transitions 0/621 dead transitions. [2025-03-14 01:37:56,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 621 transitions, 3180 flow [2025-03-14 01:37:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1990 transitions. [2025-03-14 01:37:56,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8751099384344767 [2025-03-14 01:37:56,397 INFO L175 Difference]: Start difference. First operand has 520 places, 560 transitions, 2528 flow. Second operand 6 states and 1990 transitions. [2025-03-14 01:37:56,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 621 transitions, 3180 flow [2025-03-14 01:37:56,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 621 transitions, 3072 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-14 01:37:56,417 INFO L231 Difference]: Finished difference. Result has 512 places, 609 transitions, 2974 flow [2025-03-14 01:37:56,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2974, PETRI_PLACES=512, PETRI_TRANSITIONS=609} [2025-03-14 01:37:56,418 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 137 predicate places. [2025-03-14 01:37:56,418 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 609 transitions, 2974 flow [2025-03-14 01:37:56,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 0 states have call successors, (0), 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-03-14 01:37:56,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:56,420 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:37:56,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:37:56,420 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:56,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash -403446745, now seen corresponding path program 1 times [2025-03-14 01:37:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123875115] [2025-03-14 01:37:56,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:56,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2895 statements into 1 equivalence classes. [2025-03-14 01:37:57,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2895 of 2895 statements. [2025-03-14 01:37:57,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:57,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 36506 proven. 17025 refuted. 0 times theorem prover too weak. 18110 trivial. 0 not checked. [2025-03-14 01:38:06,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:06,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123875115] [2025-03-14 01:38:06,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123875115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:06,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255598502] [2025-03-14 01:38:06,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:06,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:06,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:06,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:38:06,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:38:07,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2895 statements into 1 equivalence classes. [2025-03-14 01:38:08,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2895 of 2895 statements. [2025-03-14 01:38:08,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:08,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:08,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 11584 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:38:08,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:38:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 36506 proven. 17025 refuted. 0 times theorem prover too weak. 18110 trivial. 0 not checked. [2025-03-14 01:38:09,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:38:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 36506 proven. 17025 refuted. 0 times theorem prover too weak. 18110 trivial. 0 not checked. [2025-03-14 01:38:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255598502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:38:10,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:38:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-14 01:38:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298746362] [2025-03-14 01:38:10,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:38:10,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-14 01:38:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:10,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-14 01:38:10,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-14 01:38:11,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-03-14 01:38:11,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 609 transitions, 2974 flow. Second operand has 63 states, 63 states have (on average 363.14285714285717) internal successors, (22878), 63 states have internal predecessors, (22878), 0 states have call successors, (0), 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-03-14 01:38:11,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:11,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-03-14 01:38:11,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:17,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L1044-3-->L1044: Formula: (and (= |v_fThread1of1ForFork1_#t~ret20#1_1| 0) (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#c~0.base_93| (store (select |v_#pthreadsMutex_20| |v_~#c~0.base_93|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_93| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_93|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_20|, ~#c~0.offset=|v_~#c~0.offset_93|} OutVars{~#c~0.base=|v_~#c~0.base_93|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_19|, fThread1of1ForFork1_#t~ret20#1=|v_fThread1of1ForFork1_#t~ret20#1_1|, ~#c~0.offset=|v_~#c~0.offset_93|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret20#1][540], [Black: 394#(= |ULTIMATE.start_main_~i~0#1| 0), 4591#true, 1891#true, 13400#true, Black: 404#(= |ULTIMATE.start_main_~j~1#1| 0), 121#L1044true, 378#true, 436#true, Black: 11363#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 4618#(<= |ULTIMATE.start_main_~j~1#1| 7), 376#true, Black: 11635#(< |ULTIMATE.start_main_~j~1#1| 27), Black: 11080#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 11907#(< |ULTIMATE.start_main_~j~1#1| 26), Black: 12451#(< |ULTIMATE.start_main_~j~1#1| 24), Black: 12179#(< |ULTIMATE.start_main_~j~1#1| 25), Black: 11091#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 13391#(= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0), Black: 13393#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 2 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), Black: 13394#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 2 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 3 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), Black: 13392#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), 4602#true, 264#ULTIMATE.startFINALtrue, Black: 3315#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 440#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 4502#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 4508#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), 13389#true, Black: 1268#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 1906#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 3598#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 3062#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 4512#(and (= 0 |ULTIMATE.start_main_#t~post25#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4496#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 4538#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3326#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 1904#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1894#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4544#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4490#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 1895#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1893#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 4532#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 1896#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4550#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4594#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 1902#true, Black: 4593#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), 372#L1044true, Black: 4596#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 4595#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0))]) [2025-03-14 01:38:17,099 INFO L294 olderBase$Statistics]: this new event has 5677 ancestors and is cut-off event [2025-03-14 01:38:17,099 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-03-14 01:38:17,099 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-03-14 01:38:17,099 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-03-14 01:38:20,164 INFO L124 PetriNetUnfolderBase]: 526/11268 cut-off events. [2025-03-14 01:38:20,164 INFO L125 PetriNetUnfolderBase]: For 15131/15229 co-relation queries the response was YES. [2025-03-14 01:38:20,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15515 conditions, 11268 events. 526/11268 cut-off events. For 15131/15229 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 24612 event pairs, 115 based on Foata normal form. 81/11018 useless extension candidates. Maximal degree in co-relation 12202. Up to 318 conditions per place. [2025-03-14 01:38:20,194 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 92 selfloop transitions, 270 changer transitions 0/815 dead transitions. [2025-03-14 01:38:20,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 815 transitions, 5884 flow [2025-03-14 01:38:20,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-14 01:38:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-14 01:38:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 32637 transitions. [2025-03-14 01:38:20,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956816182937555 [2025-03-14 01:38:20,208 INFO L175 Difference]: Start difference. First operand has 512 places, 609 transitions, 2974 flow. Second operand 90 states and 32637 transitions. [2025-03-14 01:38:20,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 815 transitions, 5884 flow [2025-03-14 01:38:20,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 815 transitions, 5884 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:38:20,237 INFO L231 Difference]: Finished difference. Result has 617 places, 747 transitions, 4966 flow [2025-03-14 01:38:20,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=2974, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4966, PETRI_PLACES=617, PETRI_TRANSITIONS=747} [2025-03-14 01:38:20,239 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 242 predicate places. [2025-03-14 01:38:20,239 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 747 transitions, 4966 flow [2025-03-14 01:38:20,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 363.14285714285717) internal successors, (22878), 63 states have internal predecessors, (22878), 0 states have call successors, (0), 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-03-14 01:38:20,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:20,246 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:38:20,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:38:20,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 01:38:20,447 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:38:20,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash -96056057, now seen corresponding path program 2 times [2025-03-14 01:38:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413628592] [2025-03-14 01:38:20,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:38:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:21,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5595 statements into 2 equivalence classes. [2025-03-14 01:38:21,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 137 of 5595 statements. [2025-03-14 01:38:21,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:38:21,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 289051 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 289051 trivial. 0 not checked. [2025-03-14 01:38:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413628592] [2025-03-14 01:38:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413628592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086449821] [2025-03-14 01:38:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:21,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:21,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:21,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-03-14 01:38:21,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 747 transitions, 4966 flow. Second operand has 6 states, 6 states have (on average 323.6666666666667) internal successors, (1942), 6 states have internal predecessors, (1942), 0 states have call successors, (0), 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-03-14 01:38:21,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:21,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-03-14 01:38:21,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:31,371 INFO L124 PetriNetUnfolderBase]: 567/11131 cut-off events. [2025-03-14 01:38:31,371 INFO L125 PetriNetUnfolderBase]: For 7379/7634 co-relation queries the response was YES. [2025-03-14 01:38:31,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18754 conditions, 11131 events. 567/11131 cut-off events. For 7379/7634 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 24238 event pairs, 84 based on Foata normal form. 112/11026 useless extension candidates. Maximal degree in co-relation 14850. Up to 3244 conditions per place. [2025-03-14 01:38:31,403 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 141 selfloop transitions, 79 changer transitions 0/820 dead transitions. [2025-03-14 01:38:31,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 820 transitions, 5944 flow [2025-03-14 01:38:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1986 transitions. [2025-03-14 01:38:31,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8733509234828496 [2025-03-14 01:38:31,405 INFO L175 Difference]: Start difference. First operand has 617 places, 747 transitions, 4966 flow. Second operand 6 states and 1986 transitions. [2025-03-14 01:38:31,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 820 transitions, 5944 flow [2025-03-14 01:38:31,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 820 transitions, 5590 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-14 01:38:31,445 INFO L231 Difference]: Finished difference. Result has 585 places, 812 transitions, 5510 flow [2025-03-14 01:38:31,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=4612, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5510, PETRI_PLACES=585, PETRI_TRANSITIONS=812} [2025-03-14 01:38:31,445 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 210 predicate places. [2025-03-14 01:38:31,445 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 812 transitions, 5510 flow [2025-03-14 01:38:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.6666666666667) internal successors, (1942), 6 states have internal predecessors, (1942), 0 states have call successors, (0), 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-03-14 01:38:31,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:31,447 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:38:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:38:31,447 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:38:31,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash 377029481, now seen corresponding path program 1 times [2025-03-14 01:38:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:31,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407197252] [2025-03-14 01:38:31,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:32,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5597 statements into 1 equivalence classes. [2025-03-14 01:38:32,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5597 of 5597 statements. [2025-03-14 01:38:32,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:32,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 289051 backedges. 0 proven. 145891 refuted. 0 times theorem prover too weak. 143160 trivial. 0 not checked. [2025-03-14 01:38:44,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:44,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407197252] [2025-03-14 01:38:44,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407197252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:44,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739303246] [2025-03-14 01:38:44,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:44,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:44,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:44,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:38:44,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process