./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 11:06:22,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:06:22,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:06:22,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:06:22,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:06:22,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:06:22,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:06:22,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:06:22,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:06:22,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:06:22,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:06:22,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:06:22,605 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:06:22,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:06:22,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:06:22,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:06:22,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:06:22,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:06:22,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:06:22,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:06:22,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:06:22,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:06:22,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:06:22,607 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:06:22,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:06:22,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:06:22,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:06:22,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:06:22,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:06:22,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:06:22,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:06:22,608 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-17 11:06:22,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:06:22,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:06:22,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:06:22,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:06:22,824 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:06:22,824 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-17 11:06:23,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b1ad123/ba2501c9e1394529aa7033b458e51dee/FLAGe5498798b [2025-03-17 11:06:24,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:06:24,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2025-03-17 11:06:24,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b1ad123/ba2501c9e1394529aa7033b458e51dee/FLAGe5498798b [2025-03-17 11:06:24,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b1ad123/ba2501c9e1394529aa7033b458e51dee [2025-03-17 11:06:24,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:06:24,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:06:24,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:06:24,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:06:24,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:06:24,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c85c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24, skipping insertion in model container [2025-03-17 11:06:24,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:06:24,777 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:24,778 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:24,778 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:24,779 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:24,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:06:24,825 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:06:24,870 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:24,871 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:24,871 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:24,871 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:24,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:06:24,920 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:06:24,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24 WrapperNode [2025-03-17 11:06:24,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:06:24,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:06:24,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:06:24,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:06:24,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,968 INFO L138 Inliner]: procedures = 274, calls = 98, calls flagged for inlining = 9, calls inlined = 8, statements flattened = 270 [2025-03-17 11:06:24,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:06:24,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:06:24,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:06:24,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:06:24,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:24,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:06:24,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:06:24,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:06:24,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:06:24,998 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (1/1) ... [2025-03-17 11:06:25,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:06:25,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:25,037 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-17 11:06:25,040 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-17 11:06:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-17 11:06:25,061 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:06:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:06:25,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:06:25,062 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:06:25,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:06:25,176 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:06:25,641 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:06:25,641 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:06:25,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:06:25,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:06:25,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:06:25 BoogieIcfgContainer [2025-03-17 11:06:25,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:06:25,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:06:25,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:06:25,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:06:25,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:06:24" (1/3) ... [2025-03-17 11:06:25,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778b1f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:06:25, skipping insertion in model container [2025-03-17 11:06:25,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:24" (2/3) ... [2025-03-17 11:06:25,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778b1f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:06:25, skipping insertion in model container [2025-03-17 11:06:25,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:06:25" (3/3) ... [2025-03-17 11:06:25,666 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_22-nocollapse.i [2025-03-17 11:06:25,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:06:25,678 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-17 11:06:25,679 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:06:25,770 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:06:25,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 379 transitions, 766 flow [2025-03-17 11:06:25,903 INFO L124 PetriNetUnfolderBase]: 9/377 cut-off events. [2025-03-17 11:06:25,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:25,917 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-17 11:06:25,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 379 transitions, 766 flow [2025-03-17 11:06:25,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 760 flow [2025-03-17 11:06:25,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:06:25,944 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;@2ee05ae4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:06:25,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-17 11:06:25,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:06:25,970 INFO L124 PetriNetUnfolderBase]: 1/115 cut-off events. [2025-03-17 11:06:25,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:25,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:25,971 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-17 11:06:25,971 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-17 11:06:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash 983556455, now seen corresponding path program 1 times [2025-03-17 11:06:25,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:25,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375658111] [2025-03-17 11:06:25,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:26,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 11:06:26,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 11:06:26,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:26,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:26,825 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-17 11:06:26,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375658111] [2025-03-17 11:06:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375658111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:26,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:26,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172761559] [2025-03-17 11:06:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:26,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:26,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:27,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 379 [2025-03-17 11:06:27,284 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-17 11:06:27,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:27,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 379 [2025-03-17 11:06:27,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:27,638 INFO L124 PetriNetUnfolderBase]: 449/1850 cut-off events. [2025-03-17 11:06:27,638 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 11:06:27,646 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 11583 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-17 11:06:27,656 INFO L140 encePairwiseOnDemand]: 364/379 looper letters, 72 selfloop transitions, 10 changer transitions 1/372 dead transitions. [2025-03-17 11:06:27,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 372 transitions, 914 flow [2025-03-17 11:06:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1839 transitions. [2025-03-17 11:06:27,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8087071240105541 [2025-03-17 11:06:27,677 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 760 flow. Second operand 6 states and 1839 transitions. [2025-03-17 11:06:27,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 372 transitions, 914 flow [2025-03-17 11:06:27,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 372 transitions, 912 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:06:27,691 INFO L231 Difference]: Finished difference. Result has 376 places, 371 transitions, 766 flow [2025-03-17 11:06:27,693 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-17 11:06:27,696 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 1 predicate places. [2025-03-17 11:06:27,697 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 371 transitions, 766 flow [2025-03-17 11:06:27,698 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-17 11:06:27,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:27,698 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-17 11:06:27,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:06:27,700 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-17 11:06:27,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash -104168360, now seen corresponding path program 1 times [2025-03-17 11:06:27,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:27,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492420063] [2025-03-17 11:06:27,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:27,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 11:06:27,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 11:06:27,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:27,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:28,108 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-17 11:06:28,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492420063] [2025-03-17 11:06:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492420063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:28,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:28,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:28,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427248875] [2025-03-17 11:06:28,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:28,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:28,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:28,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:28,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 379 [2025-03-17 11:06:28,482 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-17 11:06:28,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:28,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 379 [2025-03-17 11:06:28,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:28,789 INFO L124 PetriNetUnfolderBase]: 449/1847 cut-off events. [2025-03-17 11:06:28,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:28,793 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 11459 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-17 11:06:28,801 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 72 selfloop transitions, 10 changer transitions 0/369 dead transitions. [2025-03-17 11:06:28,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 369 transitions, 926 flow [2025-03-17 11:06:28,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1836 transitions. [2025-03-17 11:06:28,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8073878627968337 [2025-03-17 11:06:28,807 INFO L175 Difference]: Start difference. First operand has 376 places, 371 transitions, 766 flow. Second operand 6 states and 1836 transitions. [2025-03-17 11:06:28,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 369 transitions, 926 flow [2025-03-17 11:06:28,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 369 transitions, 906 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:28,814 INFO L231 Difference]: Finished difference. Result has 373 places, 369 transitions, 762 flow [2025-03-17 11:06:28,816 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-17 11:06:28,817 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-03-17 11:06:28,817 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 369 transitions, 762 flow [2025-03-17 11:06:28,818 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-17 11:06:28,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:28,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:06:28,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:06:28,820 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-17 11:06:28,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash 886191252, now seen corresponding path program 1 times [2025-03-17 11:06:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:28,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198217350] [2025-03-17 11:06:28,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:28,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 11:06:28,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 11:06:28,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:28,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:28,906 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-17 11:06:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:28,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198217350] [2025-03-17 11:06:28,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198217350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:28,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:28,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:06:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008001205] [2025-03-17 11:06:28,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:28,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:06:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:28,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:06:28,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:06:28,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 379 [2025-03-17 11:06:28,922 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-17 11:06:28,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:28,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 379 [2025-03-17 11:06:28,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:28,983 INFO L124 PetriNetUnfolderBase]: 29/671 cut-off events. [2025-03-17 11:06:28,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:28,985 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 2433 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-17 11:06:28,987 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-17 11:06:28,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 370 transitions, 790 flow [2025-03-17 11:06:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:06:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:06:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-03-17 11:06:28,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9727352682497801 [2025-03-17 11:06:28,990 INFO L175 Difference]: Start difference. First operand has 373 places, 369 transitions, 762 flow. Second operand 3 states and 1106 transitions. [2025-03-17 11:06:28,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 370 transitions, 790 flow [2025-03-17 11:06:28,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 770 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:28,997 INFO L231 Difference]: Finished difference. Result has 371 places, 370 transitions, 754 flow [2025-03-17 11:06:28,998 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-17 11:06:28,999 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -4 predicate places. [2025-03-17 11:06:28,999 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 370 transitions, 754 flow [2025-03-17 11:06:28,999 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-17 11:06:29,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:29,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:29,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:06:29,000 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-17 11:06:29,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 342858887, now seen corresponding path program 1 times [2025-03-17 11:06:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:29,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318117482] [2025-03-17 11:06:29,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:29,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:29,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 11:06:29,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 11:06:29,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:29,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:29,386 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-17 11:06:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318117482] [2025-03-17 11:06:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318117482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:29,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717497810] [2025-03-17 11:06:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:29,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:29,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:29,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:29,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 379 [2025-03-17 11:06:29,757 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-17 11:06:29,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:29,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 379 [2025-03-17 11:06:29,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:29,936 INFO L124 PetriNetUnfolderBase]: 450/1969 cut-off events. [2025-03-17 11:06:29,936 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:06:29,940 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 12203 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-17 11:06:29,946 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 79 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-03-17 11:06:29,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 369 transitions, 920 flow [2025-03-17 11:06:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1831 transitions. [2025-03-17 11:06:29,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051890941072999 [2025-03-17 11:06:29,950 INFO L175 Difference]: Start difference. First operand has 371 places, 370 transitions, 754 flow. Second operand 6 states and 1831 transitions. [2025-03-17 11:06:29,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 369 transitions, 920 flow [2025-03-17 11:06:29,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 369 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:29,954 INFO L231 Difference]: Finished difference. Result has 374 places, 369 transitions, 760 flow [2025-03-17 11:06:29,956 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-17 11:06:29,956 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-03-17 11:06:29,957 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 369 transitions, 760 flow [2025-03-17 11:06:29,958 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-17 11:06:29,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:29,958 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-17 11:06:29,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:06:29,958 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-17 11:06:29,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1780871493, now seen corresponding path program 1 times [2025-03-17 11:06:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790288501] [2025-03-17 11:06:29,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:29,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 11:06:29,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 11:06:29,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:30,034 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-17 11:06:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790288501] [2025-03-17 11:06:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790288501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:30,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:30,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:06:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143136102] [2025-03-17 11:06:30,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:30,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:06:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:30,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:06:30,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:06:30,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 379 [2025-03-17 11:06:30,046 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-17 11:06:30,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:30,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 379 [2025-03-17 11:06:30,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:30,130 INFO L124 PetriNetUnfolderBase]: 29/857 cut-off events. [2025-03-17 11:06:30,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:30,133 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 2420 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-17 11:06:30,135 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-17 11:06:30,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 370 transitions, 788 flow [2025-03-17 11:06:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:06:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:06:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-03-17 11:06:30,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9727352682497801 [2025-03-17 11:06:30,137 INFO L175 Difference]: Start difference. First operand has 374 places, 369 transitions, 760 flow. Second operand 3 states and 1106 transitions. [2025-03-17 11:06:30,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 370 transitions, 788 flow [2025-03-17 11:06:30,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 370 transitions, 778 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:30,143 INFO L231 Difference]: Finished difference. Result has 372 places, 370 transitions, 762 flow [2025-03-17 11:06:30,144 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-17 11:06:30,144 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-03-17 11:06:30,144 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 370 transitions, 762 flow [2025-03-17 11:06:30,145 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-17 11:06:30,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:30,146 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-17 11:06:30,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:06:30,146 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-17 11:06:30,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1333361206, now seen corresponding path program 1 times [2025-03-17 11:06:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:30,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650275201] [2025-03-17 11:06:30,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:30,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 11:06:30,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 11:06:30,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:30,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:30,605 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-17 11:06:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650275201] [2025-03-17 11:06:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650275201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:30,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127508990] [2025-03-17 11:06:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:30,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:30,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:31,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-03-17 11:06:31,039 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-17 11:06:31,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:31,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-03-17 11:06:31,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:31,145 INFO L124 PetriNetUnfolderBase]: 75/1169 cut-off events. [2025-03-17 11:06:31,145 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:06:31,148 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 4588 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-17 11:06:31,151 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 54 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-03-17 11:06:31,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 369 transitions, 878 flow [2025-03-17 11:06:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1956 transitions. [2025-03-17 11:06:31,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8601583113456465 [2025-03-17 11:06:31,154 INFO L175 Difference]: Start difference. First operand has 372 places, 370 transitions, 762 flow. Second operand 6 states and 1956 transitions. [2025-03-17 11:06:31,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 369 transitions, 878 flow [2025-03-17 11:06:31,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 369 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:31,160 INFO L231 Difference]: Finished difference. Result has 375 places, 369 transitions, 768 flow [2025-03-17 11:06:31,161 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-17 11:06:31,161 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 0 predicate places. [2025-03-17 11:06:31,162 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 369 transitions, 768 flow [2025-03-17 11:06:31,163 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-17 11:06:31,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:31,163 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-17 11:06:31,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:06:31,163 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-17 11:06:31,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash -901996349, now seen corresponding path program 1 times [2025-03-17 11:06:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:31,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4941404] [2025-03-17 11:06:31,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:31,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 11:06:31,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 11:06:31,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:31,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:31,548 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-17 11:06:31,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4941404] [2025-03-17 11:06:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4941404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:31,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:31,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:31,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41116443] [2025-03-17 11:06:31,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:31,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:31,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:31,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:31,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:31,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 379 [2025-03-17 11:06:31,828 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-17 11:06:31,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:31,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 379 [2025-03-17 11:06:31,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:32,106 INFO L124 PetriNetUnfolderBase]: 450/2149 cut-off events. [2025-03-17 11:06:32,107 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:06:32,111 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 12218 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-17 11:06:32,117 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 79 selfloop transitions, 5 changer transitions 0/368 dead transitions. [2025-03-17 11:06:32,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 368 transitions, 934 flow [2025-03-17 11:06:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1831 transitions. [2025-03-17 11:06:32,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051890941072999 [2025-03-17 11:06:32,121 INFO L175 Difference]: Start difference. First operand has 375 places, 369 transitions, 768 flow. Second operand 6 states and 1831 transitions. [2025-03-17 11:06:32,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 368 transitions, 934 flow [2025-03-17 11:06:32,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 368 transitions, 924 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:32,129 INFO L231 Difference]: Finished difference. Result has 374 places, 368 transitions, 766 flow [2025-03-17 11:06:32,130 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-17 11:06:32,130 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-03-17 11:06:32,130 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 368 transitions, 766 flow [2025-03-17 11:06:32,131 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-17 11:06:32,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:32,131 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-17 11:06:32,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:06:32,132 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-17 11:06:32,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash 757174087, now seen corresponding path program 1 times [2025-03-17 11:06:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567640794] [2025-03-17 11:06:32,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:32,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:32,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 11:06:32,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 11:06:32,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:32,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:32,469 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-17 11:06:32,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:32,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567640794] [2025-03-17 11:06:32,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567640794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:32,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:32,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:32,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185201127] [2025-03-17 11:06:32,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:32,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:32,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:32,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:32,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 379 [2025-03-17 11:06:32,726 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-17 11:06:32,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:32,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 379 [2025-03-17 11:06:32,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:32,918 INFO L124 PetriNetUnfolderBase]: 450/2145 cut-off events. [2025-03-17 11:06:32,918 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:06:32,922 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 12256 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-17 11:06:32,930 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 75 selfloop transitions, 5 changer transitions 0/367 dead transitions. [2025-03-17 11:06:32,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 367 transitions, 924 flow [2025-03-17 11:06:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1851 transitions. [2025-03-17 11:06:32,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139841688654353 [2025-03-17 11:06:32,933 INFO L175 Difference]: Start difference. First operand has 374 places, 368 transitions, 766 flow. Second operand 6 states and 1851 transitions. [2025-03-17 11:06:32,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 367 transitions, 924 flow [2025-03-17 11:06:32,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 367 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:32,938 INFO L231 Difference]: Finished difference. Result has 373 places, 367 transitions, 764 flow [2025-03-17 11:06:32,938 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-17 11:06:32,939 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-03-17 11:06:32,939 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 367 transitions, 764 flow [2025-03-17 11:06:32,940 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-17 11:06:32,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:32,940 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-17 11:06:32,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:06:32,940 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-17 11:06:32,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1110790378, now seen corresponding path program 1 times [2025-03-17 11:06:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:32,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666078478] [2025-03-17 11:06:32,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:32,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 11:06:32,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 11:06:32,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:32,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:33,344 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-17 11:06:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666078478] [2025-03-17 11:06:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666078478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433453382] [2025-03-17 11:06:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:33,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:33,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:33,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 379 [2025-03-17 11:06:33,696 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-17 11:06:33,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:33,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 379 [2025-03-17 11:06:33,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:33,887 INFO L124 PetriNetUnfolderBase]: 450/2141 cut-off events. [2025-03-17 11:06:33,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:33,892 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 12208 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-17 11:06:33,899 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 75 selfloop transitions, 5 changer transitions 0/366 dead transitions. [2025-03-17 11:06:33,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 366 transitions, 922 flow [2025-03-17 11:06:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1851 transitions. [2025-03-17 11:06:33,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139841688654353 [2025-03-17 11:06:33,902 INFO L175 Difference]: Start difference. First operand has 373 places, 367 transitions, 764 flow. Second operand 6 states and 1851 transitions. [2025-03-17 11:06:33,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 366 transitions, 922 flow [2025-03-17 11:06:33,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 366 transitions, 912 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:33,907 INFO L231 Difference]: Finished difference. Result has 372 places, 366 transitions, 762 flow [2025-03-17 11:06:33,907 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-17 11:06:33,908 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-03-17 11:06:33,908 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 366 transitions, 762 flow [2025-03-17 11:06:33,909 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-17 11:06:33,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:33,909 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-17 11:06:33,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:06:33,909 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-17 11:06:33,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2012116701, now seen corresponding path program 1 times [2025-03-17 11:06:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124243397] [2025-03-17 11:06:33,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:33,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 11:06:33,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 11:06:33,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:33,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:06:34,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:34,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124243397] [2025-03-17 11:06:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124243397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:34,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499399759] [2025-03-17 11:06:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:34,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:34,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:34,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:34,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 379 [2025-03-17 11:06:34,528 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-17 11:06:34,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:34,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 379 [2025-03-17 11:06:34,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:34,815 INFO L124 PetriNetUnfolderBase]: 450/2137 cut-off events. [2025-03-17 11:06:34,815 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:06:34,819 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 12141 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-17 11:06:34,824 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 80 selfloop transitions, 5 changer transitions 0/365 dead transitions. [2025-03-17 11:06:34,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 365 transitions, 930 flow [2025-03-17 11:06:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1826 transitions. [2025-03-17 11:06:34,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.802990325417766 [2025-03-17 11:06:34,828 INFO L175 Difference]: Start difference. First operand has 372 places, 366 transitions, 762 flow. Second operand 6 states and 1826 transitions. [2025-03-17 11:06:34,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 365 transitions, 930 flow [2025-03-17 11:06:34,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 365 transitions, 920 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:34,832 INFO L231 Difference]: Finished difference. Result has 371 places, 365 transitions, 760 flow [2025-03-17 11:06:34,832 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-17 11:06:34,833 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -4 predicate places. [2025-03-17 11:06:34,833 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 365 transitions, 760 flow [2025-03-17 11:06:34,833 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-17 11:06:34,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:34,834 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-17 11:06:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:06:34,834 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-17 11:06:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash 194809394, now seen corresponding path program 1 times [2025-03-17 11:06:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:34,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210471810] [2025-03-17 11:06:34,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:34,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 11:06:34,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 11:06:34,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:34,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:06:34,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210471810] [2025-03-17 11:06:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210471810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278920788] [2025-03-17 11:06:34,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:34,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:34,975 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-17 11:06:34,976 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-17 11:06:35,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 11:06:35,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 11:06:35,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:35,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:35,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:06:35,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:06:35,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 11:06:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278920788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:35,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:06:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914082136] [2025-03-17 11:06:35,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:35,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:06:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:35,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:06:35,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:06:35,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-03-17 11:06:35,462 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-17 11:06:35,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:35,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-03-17 11:06:35,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:35,652 INFO L124 PetriNetUnfolderBase]: 29/1021 cut-off events. [2025-03-17 11:06:35,652 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:06:35,654 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 1823 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-17 11:06:35,656 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 15 selfloop transitions, 9 changer transitions 0/373 dead transitions. [2025-03-17 11:06:35,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 373 transitions, 826 flow [2025-03-17 11:06:35,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:06:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:06:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3275 transitions. [2025-03-17 11:06:35,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601289944297859 [2025-03-17 11:06:35,662 INFO L175 Difference]: Start difference. First operand has 371 places, 365 transitions, 760 flow. Second operand 9 states and 3275 transitions. [2025-03-17 11:06:35,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 373 transitions, 826 flow [2025-03-17 11:06:35,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 373 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:35,667 INFO L231 Difference]: Finished difference. Result has 377 places, 371 transitions, 800 flow [2025-03-17 11:06:35,668 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-17 11:06:35,668 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 2 predicate places. [2025-03-17 11:06:35,669 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 371 transitions, 800 flow [2025-03-17 11:06:35,670 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-17 11:06:35,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:35,670 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-17 11:06:35,678 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-17 11:06:35,871 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-17 11:06:35,871 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-17 11:06:35,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash -443816628, now seen corresponding path program 2 times [2025-03-17 11:06:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:35,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328403993] [2025-03-17 11:06:35,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:35,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:35,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 420 statements into 2 equivalence classes. [2025-03-17 11:06:35,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 121 of 420 statements. [2025-03-17 11:06:35,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:35,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2025-03-17 11:06:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:36,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328403993] [2025-03-17 11:06:36,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328403993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:36,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:36,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377223862] [2025-03-17 11:06:36,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:36,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:36,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:36,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:36,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:36,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 379 [2025-03-17 11:06:36,983 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-17 11:06:36,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:36,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 379 [2025-03-17 11:06:36,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:37,245 INFO L124 PetriNetUnfolderBase]: 199/1922 cut-off events. [2025-03-17 11:06:37,245 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 11:06:37,249 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 8770 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-17 11:06:37,253 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 71 selfloop transitions, 23 changer transitions 0/406 dead transitions. [2025-03-17 11:06:37,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 406 transitions, 1066 flow [2025-03-17 11:06:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1997 transitions. [2025-03-17 11:06:37,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781882145998241 [2025-03-17 11:06:37,259 INFO L175 Difference]: Start difference. First operand has 377 places, 371 transitions, 800 flow. Second operand 6 states and 1997 transitions. [2025-03-17 11:06:37,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 406 transitions, 1066 flow [2025-03-17 11:06:37,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 406 transitions, 1060 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:37,265 INFO L231 Difference]: Finished difference. Result has 386 places, 393 transitions, 952 flow [2025-03-17 11:06:37,265 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-17 11:06:37,267 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 11 predicate places. [2025-03-17 11:06:37,267 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 393 transitions, 952 flow [2025-03-17 11:06:37,268 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-17 11:06:37,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:37,268 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-17 11:06:37,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:06:37,268 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-17 11:06:37,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -954028528, now seen corresponding path program 1 times [2025-03-17 11:06:37,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:37,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005825097] [2025-03-17 11:06:37,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:37,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 11:06:37,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 11:06:37,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:37,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:37,570 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-17 11:06:37,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:37,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005825097] [2025-03-17 11:06:37,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005825097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:37,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552855142] [2025-03-17 11:06:37,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:37,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:37,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:37,573 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-17 11:06:37,575 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-17 11:06:37,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-17 11:06:37,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-17 11:06:37,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:37,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:37,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:06:37,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:38,197 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-17 11:06:38,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:38,491 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-17 11:06:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552855142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:38,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:38,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-17 11:06:38,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377540840] [2025-03-17 11:06:38,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:38,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:06:38,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:38,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:06:38,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:06:38,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 379 [2025-03-17 11:06:38,581 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-17 11:06:38,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:38,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 379 [2025-03-17 11:06:38,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:39,873 INFO L124 PetriNetUnfolderBase]: 186/3460 cut-off events. [2025-03-17 11:06:39,873 INFO L125 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2025-03-17 11:06:39,877 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 9500 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-17 11:06:39,881 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 47 selfloop transitions, 68 changer transitions 0/479 dead transitions. [2025-03-17 11:06:39,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 479 transitions, 1592 flow [2025-03-17 11:06:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-17 11:06:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-17 11:06:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 22493 transitions. [2025-03-17 11:06:39,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420362692130502 [2025-03-17 11:06:39,899 INFO L175 Difference]: Start difference. First operand has 386 places, 393 transitions, 952 flow. Second operand 63 states and 22493 transitions. [2025-03-17 11:06:39,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 479 transitions, 1592 flow [2025-03-17 11:06:39,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 479 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:06:39,905 INFO L231 Difference]: Finished difference. Result has 464 places, 455 transitions, 1472 flow [2025-03-17 11:06:39,905 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-17 11:06:39,906 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 89 predicate places. [2025-03-17 11:06:39,906 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 455 transitions, 1472 flow [2025-03-17 11:06:39,908 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-17 11:06:39,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:39,908 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-17 11:06:39,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:06:40,109 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-17 11:06:40,110 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-17 11:06:40,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1518897112, now seen corresponding path program 2 times [2025-03-17 11:06:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:40,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88957140] [2025-03-17 11:06:40,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:40,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1445 statements into 2 equivalence classes. [2025-03-17 11:06:40,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 127 of 1445 statements. [2025-03-17 11:06:40,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:40,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:40,536 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-17 11:06:40,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:40,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88957140] [2025-03-17 11:06:40,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88957140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:40,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:40,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:40,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167261435] [2025-03-17 11:06:40,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:40,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:40,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:40,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:40,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:41,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 379 [2025-03-17 11:06:41,182 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-17 11:06:41,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:41,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 379 [2025-03-17 11:06:41,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:42,244 INFO L124 PetriNetUnfolderBase]: 311/4016 cut-off events. [2025-03-17 11:06:42,245 INFO L125 PetriNetUnfolderBase]: For 710/744 co-relation queries the response was YES. [2025-03-17 11:06:42,251 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 15617 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-17 11:06:42,255 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 84 selfloop transitions, 31 changer transitions 0/494 dead transitions. [2025-03-17 11:06:42,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 494 transitions, 1822 flow [2025-03-17 11:06:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2025-03-17 11:06:42,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876429199648197 [2025-03-17 11:06:42,259 INFO L175 Difference]: Start difference. First operand has 464 places, 455 transitions, 1472 flow. Second operand 6 states and 1993 transitions. [2025-03-17 11:06:42,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 494 transitions, 1822 flow [2025-03-17 11:06:42,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 494 transitions, 1746 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-17 11:06:42,268 INFO L231 Difference]: Finished difference. Result has 467 places, 485 transitions, 1654 flow [2025-03-17 11:06:42,269 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-17 11:06:42,269 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 92 predicate places. [2025-03-17 11:06:42,270 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 485 transitions, 1654 flow [2025-03-17 11:06:42,270 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-17 11:06:42,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:42,271 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-17 11:06:42,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:06:42,271 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-17 11:06:42,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1348091676, now seen corresponding path program 1 times [2025-03-17 11:06:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745536484] [2025-03-17 11:06:42,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:42,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-03-17 11:06:42,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-03-17 11:06:42,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:42,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:44,509 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-17 11:06:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:44,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745536484] [2025-03-17 11:06:44,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745536484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:44,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201989534] [2025-03-17 11:06:44,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:44,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:44,512 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-17 11:06:44,537 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-17 11:06:45,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-03-17 11:06:45,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-03-17 11:06:45,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:45,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:45,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 5678 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:06:45,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:46,036 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-17 11:06:46,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:46,663 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-17 11:06:46,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201989534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:46,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:46,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-17 11:06:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623393241] [2025-03-17 11:06:46,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:46,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:06:46,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:46,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:06:46,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:06:46,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-03-17 11:06:46,700 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-17 11:06:46,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:46,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-03-17 11:06:46,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:48,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([729] L1044-3-->L1044: Formula: (and (= |v_fThread1of1ForFork1_#t~ret20#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_89| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_89|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_89| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#c~0.offset=|v_~#c~0.offset_89|} OutVars{~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_11|, fThread1of1ForFork1_#t~ret20#1=|v_fThread1of1ForFork1_#t~ret20#1_1|, ~#c~0.offset=|v_~#c~0.offset_89|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret20#1][421], [436#true, 376#true, Black: 394#(= |ULTIMATE.start_main_~i~0#1| 0), 4591#true, 119#L1044true, 1891#true, Black: 404#(= |ULTIMATE.start_main_~j~1#1| 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)), Black: 1268#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 1906#(<= |ULTIMATE.start_main_~i~0#1| 1), 378#true, 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: 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-17 11:06:48,760 INFO L294 olderBase$Statistics]: this new event has 2977 ancestors and is cut-off event [2025-03-17 11:06:48,760 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-03-17 11:06:48,760 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-03-17 11:06:48,760 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-03-17 11:06:49,680 INFO L124 PetriNetUnfolderBase]: 340/6486 cut-off events. [2025-03-17 11:06:49,681 INFO L125 PetriNetUnfolderBase]: For 3587/3605 co-relation queries the response was YES. [2025-03-17 11:06:49,693 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 17982 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-17 11:06:49,701 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 47 selfloop transitions, 135 changer transitions 0/586 dead transitions. [2025-03-17 11:06:49,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 586 transitions, 2782 flow [2025-03-17 11:06:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-17 11:06:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-17 11:06:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16325 transitions. [2025-03-17 11:06:49,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571973028437408 [2025-03-17 11:06:49,707 INFO L175 Difference]: Start difference. First operand has 467 places, 485 transitions, 1654 flow. Second operand 45 states and 16325 transitions. [2025-03-17 11:06:49,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 586 transitions, 2782 flow [2025-03-17 11:06:49,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 586 transitions, 2782 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:06:49,720 INFO L231 Difference]: Finished difference. Result has 520 places, 560 transitions, 2528 flow [2025-03-17 11:06:49,720 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-17 11:06:49,720 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 145 predicate places. [2025-03-17 11:06:49,721 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 560 transitions, 2528 flow [2025-03-17 11:06:49,723 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-17 11:06:49,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:49,724 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-17 11:06:49,739 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-17 11:06:49,924 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-17 11:06:49,925 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-17 11:06:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash -89924068, now seen corresponding path program 2 times [2025-03-17 11:06:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:49,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723239920] [2025-03-17 11:06:49,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:50,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2889 statements into 2 equivalence classes. [2025-03-17 11:06:50,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 131 of 2889 statements. [2025-03-17 11:06:50,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:50,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:50,520 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-17 11:06:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723239920] [2025-03-17 11:06:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723239920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:50,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:50,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570621115] [2025-03-17 11:06:50,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:50,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:50,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:50,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:50,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:50,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-03-17 11:06:50,972 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-17 11:06:50,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:50,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-03-17 11:06:50,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:53,860 INFO L124 PetriNetUnfolderBase]: 454/6743 cut-off events. [2025-03-17 11:06:53,861 INFO L125 PetriNetUnfolderBase]: For 2450/2542 co-relation queries the response was YES. [2025-03-17 11:06:53,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10686 conditions, 6743 events. 454/6743 cut-off events. For 2450/2542 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21271 event pairs, 87 based on Foata normal form. 34/6546 useless extension candidates. Maximal degree in co-relation 7275. Up to 1847 conditions per place. [2025-03-17 11:06:53,878 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 108 selfloop transitions, 55 changer transitions 0/621 dead transitions. [2025-03-17 11:06:53,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 621 transitions, 3180 flow [2025-03-17 11:06:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1990 transitions. [2025-03-17 11:06:53,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8751099384344767 [2025-03-17 11:06:53,881 INFO L175 Difference]: Start difference. First operand has 520 places, 560 transitions, 2528 flow. Second operand 6 states and 1990 transitions. [2025-03-17 11:06:53,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 621 transitions, 3180 flow [2025-03-17 11:06:53,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 621 transitions, 3072 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-17 11:06:53,899 INFO L231 Difference]: Finished difference. Result has 512 places, 609 transitions, 2974 flow [2025-03-17 11:06:53,899 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-17 11:06:53,900 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 137 predicate places. [2025-03-17 11:06:53,900 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 609 transitions, 2974 flow [2025-03-17 11:06:53,900 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-17 11:06:53,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:53,901 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-17 11:06:53,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:06:53,901 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-17 11:06:53,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash -73943456, now seen corresponding path program 1 times [2025-03-17 11:06:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:53,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383188914] [2025-03-17 11:06:53,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:53,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:54,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2895 statements into 1 equivalence classes. [2025-03-17 11:06:54,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2895 of 2895 statements. [2025-03-17 11:06:54,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:54,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:02,866 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-17 11:07:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383188914] [2025-03-17 11:07:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383188914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:07:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36833025] [2025-03-17 11:07:02,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:02,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:07:02,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:07:02,869 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-17 11:07:02,870 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-17 11:07:03,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2895 statements into 1 equivalence classes. [2025-03-17 11:07:04,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2895 of 2895 statements. [2025-03-17 11:07:04,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:04,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:04,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 11584 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:07:04,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:07:05,889 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-17 11:07:05,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:07:07,390 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-17 11:07:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36833025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:07:07,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:07:07,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-17 11:07:07,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994903383] [2025-03-17 11:07:07,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:07:07,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-17 11:07:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:07,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-17 11:07:07,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 11:07:07,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-03-17 11:07:07,453 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-17 11:07:07,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:07,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-03-17 11:07:07,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:12,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([729] L1044-3-->L1044: Formula: (and (= |v_fThread1of1ForFork1_#t~ret20#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_89| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_89|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_89| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#c~0.offset=|v_~#c~0.offset_89|} OutVars{~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_11|, fThread1of1ForFork1_#t~ret20#1=|v_fThread1of1ForFork1_#t~ret20#1_1|, ~#c~0.offset=|v_~#c~0.offset_89|} 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), 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), 119#L1044true, 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-17 11:07:12,992 INFO L294 olderBase$Statistics]: this new event has 5677 ancestors and is cut-off event [2025-03-17 11:07:12,992 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-03-17 11:07:12,993 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-03-17 11:07:12,993 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-03-17 11:07:16,391 INFO L124 PetriNetUnfolderBase]: 526/11268 cut-off events. [2025-03-17 11:07:16,391 INFO L125 PetriNetUnfolderBase]: For 15131/15229 co-relation queries the response was YES. [2025-03-17 11:07:16,412 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 24648 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-17 11:07:16,425 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 92 selfloop transitions, 270 changer transitions 0/815 dead transitions. [2025-03-17 11:07:16,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 815 transitions, 5884 flow [2025-03-17 11:07:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-17 11:07:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-17 11:07:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 32637 transitions. [2025-03-17 11:07:16,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956816182937555 [2025-03-17 11:07:16,450 INFO L175 Difference]: Start difference. First operand has 512 places, 609 transitions, 2974 flow. Second operand 90 states and 32637 transitions. [2025-03-17 11:07:16,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 815 transitions, 5884 flow [2025-03-17 11:07:16,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 815 transitions, 5884 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:07:16,484 INFO L231 Difference]: Finished difference. Result has 617 places, 747 transitions, 4966 flow [2025-03-17 11:07:16,484 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-17 11:07:16,485 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 242 predicate places. [2025-03-17 11:07:16,485 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 747 transitions, 4966 flow [2025-03-17 11:07:16,490 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-17 11:07:16,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:16,492 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-17 11:07:16,521 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-17 11:07:16,692 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-17 11:07:16,692 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-17 11:07:16,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1118396608, now seen corresponding path program 2 times [2025-03-17 11:07:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415849523] [2025-03-17 11:07:16,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:07:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:17,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5595 statements into 2 equivalence classes. [2025-03-17 11:07:17,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 137 of 5595 statements. [2025-03-17 11:07:17,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:07:17,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:17,626 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-17 11:07:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415849523] [2025-03-17 11:07:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415849523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:17,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:07:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920547144] [2025-03-17 11:07:17,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:17,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:07:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:17,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:07:17,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:07:17,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-03-17 11:07:17,950 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-17 11:07:17,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:17,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-03-17 11:07:17,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:26,484 INFO L124 PetriNetUnfolderBase]: 567/11131 cut-off events. [2025-03-17 11:07:26,484 INFO L125 PetriNetUnfolderBase]: For 7468/7730 co-relation queries the response was YES. [2025-03-17 11:07:26,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18754 conditions, 11131 events. 567/11131 cut-off events. For 7468/7730 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 24236 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-17 11:07:26,521 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 141 selfloop transitions, 79 changer transitions 0/820 dead transitions. [2025-03-17 11:07:26,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 820 transitions, 5944 flow [2025-03-17 11:07:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:07:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:07:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1986 transitions. [2025-03-17 11:07:26,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8733509234828496 [2025-03-17 11:07:26,523 INFO L175 Difference]: Start difference. First operand has 617 places, 747 transitions, 4966 flow. Second operand 6 states and 1986 transitions. [2025-03-17 11:07:26,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 820 transitions, 5944 flow [2025-03-17 11:07:26,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 820 transitions, 5590 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-17 11:07:26,564 INFO L231 Difference]: Finished difference. Result has 585 places, 812 transitions, 5510 flow [2025-03-17 11:07:26,564 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-17 11:07:26,564 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 210 predicate places. [2025-03-17 11:07:26,565 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 812 transitions, 5510 flow [2025-03-17 11:07:26,565 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-17 11:07:26,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:26,566 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-17 11:07:26,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:07:26,566 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-17 11:07:26,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash -783446656, now seen corresponding path program 1 times [2025-03-17 11:07:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008009479] [2025-03-17 11:07:26,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:27,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5597 statements into 1 equivalence classes. [2025-03-17 11:07:27,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5597 of 5597 statements. [2025-03-17 11:07:27,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:27,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat