./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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/weaver/loop-tiling-eq.wvr.c -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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:24:15,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:24:15,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:24:15,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:24:15,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:24:15,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:24:15,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:24:15,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:24:15,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:24:15,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:24:15,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:24:15,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:24:15,971 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:24:15,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:24:15,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:24:15,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:24:15,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:24:15,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:24:15,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:24:15,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:15,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:24:15,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:24:15,975 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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-03-13 22:24:16,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:24:16,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:24:16,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:24:16,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:24:16,210 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:24:16,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-13 22:24:17,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d9efac2/63f82f140b474d0ead8f1cfe8f973a2e/FLAGc41793d16 [2025-03-13 22:24:17,604 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:24:17,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-13 22:24:17,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d9efac2/63f82f140b474d0ead8f1cfe8f973a2e/FLAGc41793d16 [2025-03-13 22:24:17,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d9efac2/63f82f140b474d0ead8f1cfe8f973a2e [2025-03-13 22:24:17,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:24:17,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:24:17,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:17,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:24:17,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:24:17,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2908e98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17, skipping insertion in model container [2025-03-13 22:24:17,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:24:17,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:17,781 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:24:17,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:17,816 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:24:17,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17 WrapperNode [2025-03-13 22:24:17,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:17,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:17,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:24:17,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:24:17,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,853 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 321 [2025-03-13 22:24:17,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:17,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:24:17,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:24:17,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:24:17,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:24:17,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:24:17,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:24:17,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:24:17,898 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (1/1) ... [2025-03-13 22:24:17,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:17,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:24:17,929 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-13 22:24:17,931 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-13 22:24:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:24:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:24:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:24:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:24:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:24:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:24:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:24:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:24:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:24:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:24:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:24:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:24:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:24:17,953 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:24:18,038 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:24:18,039 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:24:18,583 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:24:18,584 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:24:18,584 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:24:18,601 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:24:18,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:18 BoogieIcfgContainer [2025-03-13 22:24:18,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:24:18,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:24:18,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:24:18,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:24:18,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:24:17" (1/3) ... [2025-03-13 22:24:18,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0e4bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:18, skipping insertion in model container [2025-03-13 22:24:18,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:17" (2/3) ... [2025-03-13 22:24:18,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0e4bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:18, skipping insertion in model container [2025-03-13 22:24:18,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:18" (3/3) ... [2025-03-13 22:24:18,613 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-03-13 22:24:18,624 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:24:18,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 505 locations, 1 initial locations, 7 loop locations, and 55 error locations. [2025-03-13 22:24:18,627 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:24:18,741 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:24:18,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 531 transitions, 1076 flow [2025-03-13 22:24:18,917 INFO L124 PetriNetUnfolderBase]: 27/529 cut-off events. [2025-03-13 22:24:18,918 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:18,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 529 events. 27/529 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 887 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 347. Up to 2 conditions per place. [2025-03-13 22:24:18,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 511 places, 531 transitions, 1076 flow [2025-03-13 22:24:18,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 490 places, 509 transitions, 1030 flow [2025-03-13 22:24:18,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:24:18,954 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;@ce43ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:24:18,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-13 22:24:18,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:24:18,961 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-13 22:24:18,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:24:18,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:18,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:18,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:18,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2026690931, now seen corresponding path program 1 times [2025-03-13 22:24:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336897800] [2025-03-13 22:24:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:19,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 22:24:19,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 22:24:19,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:19,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:19,103 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-13 22:24:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:19,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336897800] [2025-03-13 22:24:19,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336897800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:19,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:19,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247270998] [2025-03-13 22:24:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:19,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:19,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:19,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:19,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 495 out of 531 [2025-03-13 22:24:19,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 509 transitions, 1030 flow. Second operand has 3 states, 3 states have (on average 496.3333333333333) internal successors, (1489), 3 states have internal predecessors, (1489), 0 states have call successors, (0), 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-13 22:24:19,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:19,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 495 of 531 [2025-03-13 22:24:19,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:19,308 INFO L124 PetriNetUnfolderBase]: 13/497 cut-off events. [2025-03-13 22:24:19,308 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-13 22:24:19,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 497 events. 13/497 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 880 event pairs, 2 based on Foata normal form. 18/439 useless extension candidates. Maximal degree in co-relation 344. Up to 20 conditions per place. [2025-03-13 22:24:19,311 INFO L140 encePairwiseOnDemand]: 513/531 looper letters, 15 selfloop transitions, 2 changer transitions 11/493 dead transitions. [2025-03-13 22:24:19,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 493 transitions, 1032 flow [2025-03-13 22:24:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2025-03-13 22:24:19,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529190207156308 [2025-03-13 22:24:19,329 INFO L175 Difference]: Start difference. First operand has 490 places, 509 transitions, 1030 flow. Second operand 3 states and 1518 transitions. [2025-03-13 22:24:19,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 493 transitions, 1032 flow [2025-03-13 22:24:19,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 493 transitions, 1024 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:24:19,345 INFO L231 Difference]: Finished difference. Result has 487 places, 482 transitions, 972 flow [2025-03-13 22:24:19,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=487, PETRI_TRANSITIONS=482} [2025-03-13 22:24:19,351 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -3 predicate places. [2025-03-13 22:24:19,352 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 482 transitions, 972 flow [2025-03-13 22:24:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 496.3333333333333) internal successors, (1489), 3 states have internal predecessors, (1489), 0 states have call successors, (0), 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-13 22:24:19,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:19,353 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] [2025-03-13 22:24:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:24:19,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:19,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash 752165360, now seen corresponding path program 1 times [2025-03-13 22:24:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751932814] [2025-03-13 22:24:19,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:19,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:24:19,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:24:19,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:19,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:19,396 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-13 22:24:19,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:19,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751932814] [2025-03-13 22:24:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751932814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:19,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:19,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932216463] [2025-03-13 22:24:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:19,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:19,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:19,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:19,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 531 [2025-03-13 22:24:19,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 482 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 486.0) internal successors, (1458), 3 states have internal predecessors, (1458), 0 states have call successors, (0), 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-13 22:24:19,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:19,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 531 [2025-03-13 22:24:19,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:19,498 INFO L124 PetriNetUnfolderBase]: 18/533 cut-off events. [2025-03-13 22:24:19,498 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:24:19,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 533 events. 18/533 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1172 event pairs, 4 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 539. Up to 30 conditions per place. [2025-03-13 22:24:19,501 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 20 selfloop transitions, 1 changer transitions 0/474 dead transitions. [2025-03-13 22:24:19,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 474 transitions, 998 flow [2025-03-13 22:24:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-03-13 22:24:19,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315756434400502 [2025-03-13 22:24:19,504 INFO L175 Difference]: Start difference. First operand has 487 places, 482 transitions, 972 flow. Second operand 3 states and 1484 transitions. [2025-03-13 22:24:19,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 474 transitions, 998 flow [2025-03-13 22:24:19,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 474 transitions, 994 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:19,510 INFO L231 Difference]: Finished difference. Result has 468 places, 474 transitions, 954 flow [2025-03-13 22:24:19,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=468, PETRI_TRANSITIONS=474} [2025-03-13 22:24:19,511 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-03-13 22:24:19,511 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 474 transitions, 954 flow [2025-03-13 22:24:19,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.0) internal successors, (1458), 3 states have internal predecessors, (1458), 0 states have call successors, (0), 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-13 22:24:19,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:19,512 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] [2025-03-13 22:24:19,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:24:19,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:19,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:19,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1636942434, now seen corresponding path program 1 times [2025-03-13 22:24:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:19,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721814979] [2025-03-13 22:24:19,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:19,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 22:24:19,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 22:24:19,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:19,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:19,554 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-13 22:24:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721814979] [2025-03-13 22:24:19,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721814979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:19,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:19,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:19,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432881942] [2025-03-13 22:24:19,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:19,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:19,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:19,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:19,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:19,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 531 [2025-03-13 22:24:19,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 474 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 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-13 22:24:19,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:19,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 531 [2025-03-13 22:24:19,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:19,668 INFO L124 PetriNetUnfolderBase]: 12/475 cut-off events. [2025-03-13 22:24:19,668 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:19,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 475 events. 12/475 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 779 event pairs, 1 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 469. Up to 19 conditions per place. [2025-03-13 22:24:19,670 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 16 selfloop transitions, 2 changer transitions 0/473 dead transitions. [2025-03-13 22:24:19,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 473 transitions, 988 flow [2025-03-13 22:24:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1501 transitions. [2025-03-13 22:24:19,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9422473320778405 [2025-03-13 22:24:19,673 INFO L175 Difference]: Start difference. First operand has 468 places, 474 transitions, 954 flow. Second operand 3 states and 1501 transitions. [2025-03-13 22:24:19,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 473 transitions, 988 flow [2025-03-13 22:24:19,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 473 transitions, 987 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:19,678 INFO L231 Difference]: Finished difference. Result has 468 places, 473 transitions, 955 flow [2025-03-13 22:24:19,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=955, PETRI_PLACES=468, PETRI_TRANSITIONS=473} [2025-03-13 22:24:19,680 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-03-13 22:24:19,680 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 473 transitions, 955 flow [2025-03-13 22:24:19,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 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-13 22:24:19,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:19,681 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] [2025-03-13 22:24:19,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:24:19,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:19,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash -438557690, now seen corresponding path program 1 times [2025-03-13 22:24:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051914746] [2025-03-13 22:24:19,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:19,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 22:24:19,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 22:24:19,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:19,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:19,737 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-13 22:24:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051914746] [2025-03-13 22:24:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051914746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:19,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199022874] [2025-03-13 22:24:19,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:19,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:19,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:19,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:19,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 531 [2025-03-13 22:24:19,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 473 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:19,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:19,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 531 [2025-03-13 22:24:19,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:19,853 INFO L124 PetriNetUnfolderBase]: 15/519 cut-off events. [2025-03-13 22:24:19,853 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:24:19,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 519 events. 15/519 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1058 event pairs, 2 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 524. Up to 27 conditions per place. [2025-03-13 22:24:19,857 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 22 selfloop transitions, 1 changer transitions 0/464 dead transitions. [2025-03-13 22:24:19,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 464 transitions, 983 flow [2025-03-13 22:24:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1478 transitions. [2025-03-13 22:24:19,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278091650973007 [2025-03-13 22:24:19,862 INFO L175 Difference]: Start difference. First operand has 468 places, 473 transitions, 955 flow. Second operand 3 states and 1478 transitions. [2025-03-13 22:24:19,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 464 transitions, 983 flow [2025-03-13 22:24:19,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 464 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:19,868 INFO L231 Difference]: Finished difference. Result has 459 places, 464 transitions, 935 flow [2025-03-13 22:24:19,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=935, PETRI_PLACES=459, PETRI_TRANSITIONS=464} [2025-03-13 22:24:19,869 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -31 predicate places. [2025-03-13 22:24:19,869 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 464 transitions, 935 flow [2025-03-13 22:24:19,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:19,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:19,871 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] [2025-03-13 22:24:19,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:24:19,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash -296406292, now seen corresponding path program 1 times [2025-03-13 22:24:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:19,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033751855] [2025-03-13 22:24:19,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:19,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 22:24:19,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 22:24:19,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:19,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:19,947 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-13 22:24:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:19,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033751855] [2025-03-13 22:24:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033751855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504325528] [2025-03-13 22:24:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:19,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:19,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:19,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-03-13 22:24:19,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 464 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 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-13 22:24:19,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:19,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-03-13 22:24:19,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:20,025 INFO L124 PetriNetUnfolderBase]: 13/499 cut-off events. [2025-03-13 22:24:20,026 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:24:20,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 499 events. 13/499 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 957 event pairs, 1 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 490. Up to 14 conditions per place. [2025-03-13 22:24:20,028 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 10 selfloop transitions, 2 changer transitions 0/463 dead transitions. [2025-03-13 22:24:20,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 463 transitions, 957 flow [2025-03-13 22:24:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1513 transitions. [2025-03-13 22:24:20,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497802887633396 [2025-03-13 22:24:20,031 INFO L175 Difference]: Start difference. First operand has 459 places, 464 transitions, 935 flow. Second operand 3 states and 1513 transitions. [2025-03-13 22:24:20,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 463 transitions, 957 flow [2025-03-13 22:24:20,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 463 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:20,037 INFO L231 Difference]: Finished difference. Result has 459 places, 463 transitions, 936 flow [2025-03-13 22:24:20,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=459, PETRI_TRANSITIONS=463} [2025-03-13 22:24:20,038 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -31 predicate places. [2025-03-13 22:24:20,038 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 463 transitions, 936 flow [2025-03-13 22:24:20,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 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-13 22:24:20,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:20,039 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] [2025-03-13 22:24:20,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:24:20,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:20,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash 213581893, now seen corresponding path program 1 times [2025-03-13 22:24:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:20,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230448455] [2025-03-13 22:24:20,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:20,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-13 22:24:20,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-13 22:24:20,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:20,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:20,093 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-13 22:24:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230448455] [2025-03-13 22:24:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230448455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579538357] [2025-03-13 22:24:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:20,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:20,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:20,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:20,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-03-13 22:24:20,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 463 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 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-13 22:24:20,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:20,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-03-13 22:24:20,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:20,162 INFO L124 PetriNetUnfolderBase]: 14/496 cut-off events. [2025-03-13 22:24:20,162 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:20,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 496 events. 14/496 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 946 event pairs, 2 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 492. Up to 15 conditions per place. [2025-03-13 22:24:20,164 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 10 selfloop transitions, 1 changer transitions 0/460 dead transitions. [2025-03-13 22:24:20,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 460 transitions, 952 flow [2025-03-13 22:24:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1514 transitions. [2025-03-13 22:24:20,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9504080351537979 [2025-03-13 22:24:20,167 INFO L175 Difference]: Start difference. First operand has 459 places, 463 transitions, 936 flow. Second operand 3 states and 1514 transitions. [2025-03-13 22:24:20,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 460 transitions, 952 flow [2025-03-13 22:24:20,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 460 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:20,173 INFO L231 Difference]: Finished difference. Result has 456 places, 460 transitions, 928 flow [2025-03-13 22:24:20,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=460} [2025-03-13 22:24:20,174 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -34 predicate places. [2025-03-13 22:24:20,174 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 460 transitions, 928 flow [2025-03-13 22:24:20,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 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-13 22:24:20,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:20,175 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] [2025-03-13 22:24:20,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:24:20,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:20,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1472543848, now seen corresponding path program 1 times [2025-03-13 22:24:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:20,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801844837] [2025-03-13 22:24:20,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:20,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:24:20,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:24:20,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:20,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:20,799 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-13 22:24:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801844837] [2025-03-13 22:24:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801844837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987587570] [2025-03-13 22:24:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:20,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:24:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:20,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:24:20,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:24:21,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 531 [2025-03-13 22:24:21,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 460 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 433.5) internal successors, (2601), 6 states have internal predecessors, (2601), 0 states have call successors, (0), 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-13 22:24:21,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:21,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 531 [2025-03-13 22:24:21,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:21,331 INFO L124 PetriNetUnfolderBase]: 172/1159 cut-off events. [2025-03-13 22:24:21,331 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-13 22:24:21,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 1159 events. 172/1159 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5705 event pairs, 116 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1490. Up to 332 conditions per place. [2025-03-13 22:24:21,337 INFO L140 encePairwiseOnDemand]: 513/531 looper letters, 64 selfloop transitions, 15 changer transitions 0/457 dead transitions. [2025-03-13 22:24:21,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 457 transitions, 1080 flow [2025-03-13 22:24:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:24:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:24:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2674 transitions. [2025-03-13 22:24:21,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8392969240426867 [2025-03-13 22:24:21,342 INFO L175 Difference]: Start difference. First operand has 456 places, 460 transitions, 928 flow. Second operand 6 states and 2674 transitions. [2025-03-13 22:24:21,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 457 transitions, 1080 flow [2025-03-13 22:24:21,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 457 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:21,347 INFO L231 Difference]: Finished difference. Result has 457 places, 457 transitions, 951 flow [2025-03-13 22:24:21,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=951, PETRI_PLACES=457, PETRI_TRANSITIONS=457} [2025-03-13 22:24:21,348 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -33 predicate places. [2025-03-13 22:24:21,348 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 457 transitions, 951 flow [2025-03-13 22:24:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 433.5) internal successors, (2601), 6 states have internal predecessors, (2601), 0 states have call successors, (0), 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-13 22:24:21,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:21,350 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] [2025-03-13 22:24:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:24:21,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1601503436, now seen corresponding path program 1 times [2025-03-13 22:24:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069156436] [2025-03-13 22:24:21,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:21,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:21,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-13 22:24:21,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 22:24:21,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:21,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:21,392 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-13 22:24:21,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069156436] [2025-03-13 22:24:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069156436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:21,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677996793] [2025-03-13 22:24:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:21,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:21,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:21,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:21,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 531 [2025-03-13 22:24:21,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 457 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 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-13 22:24:21,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:21,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 531 [2025-03-13 22:24:21,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:21,451 INFO L124 PetriNetUnfolderBase]: 14/514 cut-off events. [2025-03-13 22:24:21,451 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:24:21,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 514 events. 14/514 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1045 event pairs, 1 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 519. Up to 12 conditions per place. [2025-03-13 22:24:21,453 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 9 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2025-03-13 22:24:21,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 456 transitions, 971 flow [2025-03-13 22:24:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-03-13 22:24:21,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510357815442562 [2025-03-13 22:24:21,457 INFO L175 Difference]: Start difference. First operand has 457 places, 457 transitions, 951 flow. Second operand 3 states and 1515 transitions. [2025-03-13 22:24:21,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 456 transitions, 971 flow [2025-03-13 22:24:21,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 456 transitions, 941 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:24:21,463 INFO L231 Difference]: Finished difference. Result has 453 places, 456 transitions, 923 flow [2025-03-13 22:24:21,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2025-03-13 22:24:21,464 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2025-03-13 22:24:21,465 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 923 flow [2025-03-13 22:24:21,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 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-13 22:24:21,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:21,466 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] [2025-03-13 22:24:21,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:24:21,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash -524581588, now seen corresponding path program 1 times [2025-03-13 22:24:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:21,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533495074] [2025-03-13 22:24:21,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:21,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-13 22:24:21,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-13 22:24:21,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:21,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:21,522 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-13 22:24:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:21,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533495074] [2025-03-13 22:24:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533495074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523265338] [2025-03-13 22:24:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:21,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:21,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:21,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 531 [2025-03-13 22:24:21,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 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-13 22:24:21,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:21,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 531 [2025-03-13 22:24:21,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:21,580 INFO L124 PetriNetUnfolderBase]: 16/516 cut-off events. [2025-03-13 22:24:21,581 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:21,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 516 events. 16/516 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1103 event pairs, 3 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 512. Up to 16 conditions per place. [2025-03-13 22:24:21,583 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 9 selfloop transitions, 2 changer transitions 0/455 dead transitions. [2025-03-13 22:24:21,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 455 transitions, 943 flow [2025-03-13 22:24:21,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-03-13 22:24:21,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510357815442562 [2025-03-13 22:24:21,587 INFO L175 Difference]: Start difference. First operand has 453 places, 456 transitions, 923 flow. Second operand 3 states and 1515 transitions. [2025-03-13 22:24:21,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 455 transitions, 943 flow [2025-03-13 22:24:21,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 455 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:21,593 INFO L231 Difference]: Finished difference. Result has 452 places, 455 transitions, 921 flow [2025-03-13 22:24:21,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=921, PETRI_PLACES=452, PETRI_TRANSITIONS=455} [2025-03-13 22:24:21,594 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -38 predicate places. [2025-03-13 22:24:21,594 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 455 transitions, 921 flow [2025-03-13 22:24:21,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 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-13 22:24:21,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:21,595 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] [2025-03-13 22:24:21,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:24:21,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:21,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash 141265578, now seen corresponding path program 1 times [2025-03-13 22:24:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6698612] [2025-03-13 22:24:21,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:21,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-13 22:24:21,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-13 22:24:21,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:21,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:21,646 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-13 22:24:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6698612] [2025-03-13 22:24:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6698612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975282706] [2025-03-13 22:24:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:21,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:21,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:21,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:21,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-03-13 22:24:21,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 455 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 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-13 22:24:21,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:21,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-03-13 22:24:21,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:21,706 INFO L124 PetriNetUnfolderBase]: 12/456 cut-off events. [2025-03-13 22:24:21,707 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:21,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 456 events. 12/456 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs, 1 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 448. Up to 13 conditions per place. [2025-03-13 22:24:21,709 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 10 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-03-13 22:24:21,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 454 transitions, 943 flow [2025-03-13 22:24:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1513 transitions. [2025-03-13 22:24:21,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497802887633396 [2025-03-13 22:24:21,711 INFO L175 Difference]: Start difference. First operand has 452 places, 455 transitions, 921 flow. Second operand 3 states and 1513 transitions. [2025-03-13 22:24:21,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 454 transitions, 943 flow [2025-03-13 22:24:21,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 454 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:21,717 INFO L231 Difference]: Finished difference. Result has 451 places, 454 transitions, 919 flow [2025-03-13 22:24:21,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=919, PETRI_PLACES=451, PETRI_TRANSITIONS=454} [2025-03-13 22:24:21,718 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -39 predicate places. [2025-03-13 22:24:21,718 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 454 transitions, 919 flow [2025-03-13 22:24:21,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 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-13 22:24:21,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:21,719 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] [2025-03-13 22:24:21,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:24:21,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:21,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 985808609, now seen corresponding path program 1 times [2025-03-13 22:24:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:21,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023884115] [2025-03-13 22:24:21,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:21,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-13 22:24:21,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-13 22:24:21,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:21,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:21,861 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-13 22:24:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023884115] [2025-03-13 22:24:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023884115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98998245] [2025-03-13 22:24:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:21,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:24:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:21,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:24:21,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:24:21,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-13 22:24:21,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 454 transitions, 919 flow. Second operand has 5 states, 5 states have (on average 498.6) internal successors, (2493), 5 states have internal predecessors, (2493), 0 states have call successors, (0), 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-13 22:24:21,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:21,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-13 22:24:21,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:22,011 INFO L124 PetriNetUnfolderBase]: 18/788 cut-off events. [2025-03-13 22:24:22,011 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:22,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 788 events. 18/788 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2212 event pairs, 0 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 793. Up to 12 conditions per place. [2025-03-13 22:24:22,014 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 16 selfloop transitions, 7 changer transitions 0/461 dead transitions. [2025-03-13 22:24:22,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 461 transitions, 983 flow [2025-03-13 22:24:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:24:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:24:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2509 transitions. [2025-03-13 22:24:22,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450094161958569 [2025-03-13 22:24:22,019 INFO L175 Difference]: Start difference. First operand has 451 places, 454 transitions, 919 flow. Second operand 5 states and 2509 transitions. [2025-03-13 22:24:22,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 461 transitions, 983 flow [2025-03-13 22:24:22,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 461 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:22,027 INFO L231 Difference]: Finished difference. Result has 455 places, 456 transitions, 946 flow [2025-03-13 22:24:22,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=946, PETRI_PLACES=455, PETRI_TRANSITIONS=456} [2025-03-13 22:24:22,029 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -35 predicate places. [2025-03-13 22:24:22,029 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 456 transitions, 946 flow [2025-03-13 22:24:22,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 498.6) internal successors, (2493), 5 states have internal predecessors, (2493), 0 states have call successors, (0), 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-13 22:24:22,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:22,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:22,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:24:22,030 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:22,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash 321950551, now seen corresponding path program 1 times [2025-03-13 22:24:22,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:22,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749794672] [2025-03-13 22:24:22,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:22,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:22,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-13 22:24:22,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-13 22:24:22,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:22,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:22,104 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-13 22:24:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749794672] [2025-03-13 22:24:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749794672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:22,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300986242] [2025-03-13 22:24:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:22,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:22,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:22,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:22,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-03-13 22:24:22,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 456 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 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-13 22:24:22,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:22,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-03-13 22:24:22,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:22,231 INFO L124 PetriNetUnfolderBase]: 39/1132 cut-off events. [2025-03-13 22:24:22,231 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-13 22:24:22,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1132 events. 39/1132 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4225 event pairs, 0 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1169. Up to 31 conditions per place. [2025-03-13 22:24:22,237 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 15 selfloop transitions, 3 changer transitions 0/460 dead transitions. [2025-03-13 22:24:22,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 460 transitions, 994 flow [2025-03-13 22:24:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2025-03-13 22:24:22,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548022598870056 [2025-03-13 22:24:22,240 INFO L175 Difference]: Start difference. First operand has 455 places, 456 transitions, 946 flow. Second operand 3 states and 1521 transitions. [2025-03-13 22:24:22,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 460 transitions, 994 flow [2025-03-13 22:24:22,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 460 transitions, 987 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:22,246 INFO L231 Difference]: Finished difference. Result has 453 places, 456 transitions, 954 flow [2025-03-13 22:24:22,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2025-03-13 22:24:22,247 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2025-03-13 22:24:22,248 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 954 flow [2025-03-13 22:24:22,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 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-13 22:24:22,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:22,249 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] [2025-03-13 22:24:22,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:24:22,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:22,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -779999487, now seen corresponding path program 1 times [2025-03-13 22:24:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:22,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832353014] [2025-03-13 22:24:22,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:22,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-13 22:24:22,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-13 22:24:22,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:22,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:22,294 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-13 22:24:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:22,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832353014] [2025-03-13 22:24:22,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832353014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:22,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422110968] [2025-03-13 22:24:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:22,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:22,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:22,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:22,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 531 [2025-03-13 22:24:22,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 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-13 22:24:22,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:22,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 531 [2025-03-13 22:24:22,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:22,436 INFO L124 PetriNetUnfolderBase]: 55/1376 cut-off events. [2025-03-13 22:24:22,436 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2025-03-13 22:24:22,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 1376 events. 55/1376 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5959 event pairs, 0 based on Foata normal form. 0/1237 useless extension candidates. Maximal degree in co-relation 1448. Up to 43 conditions per place. [2025-03-13 22:24:22,441 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 12 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-03-13 22:24:22,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 459 transitions, 991 flow [2025-03-13 22:24:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1525 transitions. [2025-03-13 22:24:22,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9573132454488387 [2025-03-13 22:24:22,444 INFO L175 Difference]: Start difference. First operand has 453 places, 456 transitions, 954 flow. Second operand 3 states and 1525 transitions. [2025-03-13 22:24:22,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 459 transitions, 991 flow [2025-03-13 22:24:22,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 459 transitions, 991 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:22,450 INFO L231 Difference]: Finished difference. Result has 454 places, 456 transitions, 964 flow [2025-03-13 22:24:22,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=454, PETRI_TRANSITIONS=456} [2025-03-13 22:24:22,451 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -36 predicate places. [2025-03-13 22:24:22,452 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 456 transitions, 964 flow [2025-03-13 22:24:22,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 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-13 22:24:22,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:22,453 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] [2025-03-13 22:24:22,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:24:22,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2039803266, now seen corresponding path program 1 times [2025-03-13 22:24:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256050971] [2025-03-13 22:24:22,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:22,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-13 22:24:22,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-13 22:24:22,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:22,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:22,530 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-13 22:24:22,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256050971] [2025-03-13 22:24:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256050971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:22,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:22,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:22,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643172919] [2025-03-13 22:24:22,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:22,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:22,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:22,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:22,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 531 [2025-03-13 22:24:22,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 456 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 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-13 22:24:22,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:22,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 531 [2025-03-13 22:24:22,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:22,755 INFO L124 PetriNetUnfolderBase]: 95/2044 cut-off events. [2025-03-13 22:24:22,755 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 22:24:22,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 2044 events. 95/2044 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11958 event pairs, 8 based on Foata normal form. 0/1828 useless extension candidates. Maximal degree in co-relation 2198. Up to 84 conditions per place. [2025-03-13 22:24:22,763 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 12 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-03-13 22:24:22,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 459 transitions, 1001 flow [2025-03-13 22:24:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1525 transitions. [2025-03-13 22:24:22,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9573132454488387 [2025-03-13 22:24:22,766 INFO L175 Difference]: Start difference. First operand has 454 places, 456 transitions, 964 flow. Second operand 3 states and 1525 transitions. [2025-03-13 22:24:22,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 459 transitions, 1001 flow [2025-03-13 22:24:22,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 459 transitions, 1001 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:22,772 INFO L231 Difference]: Finished difference. Result has 455 places, 456 transitions, 974 flow [2025-03-13 22:24:22,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=974, PETRI_PLACES=455, PETRI_TRANSITIONS=456} [2025-03-13 22:24:22,774 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -35 predicate places. [2025-03-13 22:24:22,774 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 456 transitions, 974 flow [2025-03-13 22:24:22,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 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-13 22:24:22,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:22,775 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] [2025-03-13 22:24:22,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:24:22,775 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:22,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash 908001637, now seen corresponding path program 1 times [2025-03-13 22:24:22,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:22,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151623735] [2025-03-13 22:24:22,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:22,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-13 22:24:22,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-13 22:24:22,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:22,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:22,937 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-13 22:24:22,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:22,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151623735] [2025-03-13 22:24:22,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151623735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:22,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:22,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:24:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439535215] [2025-03-13 22:24:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:22,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:24:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:22,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:24:22,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:24:23,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 531 [2025-03-13 22:24:23,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 456 transitions, 974 flow. Second operand has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 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-13 22:24:23,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:23,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 531 [2025-03-13 22:24:23,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:23,581 INFO L124 PetriNetUnfolderBase]: 123/2878 cut-off events. [2025-03-13 22:24:23,581 INFO L125 PetriNetUnfolderBase]: For 19/37 co-relation queries the response was YES. [2025-03-13 22:24:23,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 2878 events. 123/2878 cut-off events. For 19/37 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 18167 event pairs, 18 based on Foata normal form. 8/2620 useless extension candidates. Maximal degree in co-relation 3253. Up to 100 conditions per place. [2025-03-13 22:24:23,596 INFO L140 encePairwiseOnDemand]: 510/531 looper letters, 44 selfloop transitions, 28 changer transitions 0/491 dead transitions. [2025-03-13 22:24:23,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 491 transitions, 1193 flow [2025-03-13 22:24:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:24:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:24:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4843 transitions. [2025-03-13 22:24:23,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9120527306967985 [2025-03-13 22:24:23,603 INFO L175 Difference]: Start difference. First operand has 455 places, 456 transitions, 974 flow. Second operand 10 states and 4843 transitions. [2025-03-13 22:24:23,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 491 transitions, 1193 flow [2025-03-13 22:24:23,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 491 transitions, 1193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:23,608 INFO L231 Difference]: Finished difference. Result has 468 places, 472 transitions, 1103 flow [2025-03-13 22:24:23,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1103, PETRI_PLACES=468, PETRI_TRANSITIONS=472} [2025-03-13 22:24:23,609 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-03-13 22:24:23,609 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 472 transitions, 1103 flow [2025-03-13 22:24:23,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 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-13 22:24:23,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:23,611 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] [2025-03-13 22:24:23,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:24:23,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:23,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:23,611 INFO L85 PathProgramCache]: Analyzing trace with hash -24300357, now seen corresponding path program 1 times [2025-03-13 22:24:23,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:23,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200418834] [2025-03-13 22:24:23,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:23,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:23,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-13 22:24:23,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-13 22:24:23,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:23,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:23,754 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-13 22:24:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200418834] [2025-03-13 22:24:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200418834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:23,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695816361] [2025-03-13 22:24:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:23,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:24:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:23,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:24:23,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:24:23,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-13 22:24:23,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 472 transitions, 1103 flow. Second operand has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 0 states have call successors, (0), 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-13 22:24:23,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:23,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-13 22:24:23,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:24,052 INFO L124 PetriNetUnfolderBase]: 122/2431 cut-off events. [2025-03-13 22:24:24,052 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2025-03-13 22:24:24,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 2431 events. 122/2431 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 14400 event pairs, 33 based on Foata normal form. 5/2226 useless extension candidates. Maximal degree in co-relation 2800. Up to 115 conditions per place. [2025-03-13 22:24:24,061 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 17 selfloop transitions, 7 changer transitions 0/480 dead transitions. [2025-03-13 22:24:24,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 480 transitions, 1172 flow [2025-03-13 22:24:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:24:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:24:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2510 transitions. [2025-03-13 22:24:24,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453860640301318 [2025-03-13 22:24:24,064 INFO L175 Difference]: Start difference. First operand has 468 places, 472 transitions, 1103 flow. Second operand 5 states and 2510 transitions. [2025-03-13 22:24:24,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 480 transitions, 1172 flow [2025-03-13 22:24:24,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 480 transitions, 1172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:24,071 INFO L231 Difference]: Finished difference. Result has 474 places, 474 transitions, 1134 flow [2025-03-13 22:24:24,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1134, PETRI_PLACES=474, PETRI_TRANSITIONS=474} [2025-03-13 22:24:24,072 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -16 predicate places. [2025-03-13 22:24:24,072 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 474 transitions, 1134 flow [2025-03-13 22:24:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 0 states have call successors, (0), 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-13 22:24:24,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:24,073 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] [2025-03-13 22:24:24,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:24:24,074 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:24,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash 240665009, now seen corresponding path program 1 times [2025-03-13 22:24:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:24,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947753771] [2025-03-13 22:24:24,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:24,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-13 22:24:24,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-13 22:24:24,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:24,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:24,176 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-13 22:24:24,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947753771] [2025-03-13 22:24:24,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947753771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:24,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:24,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:24,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462097560] [2025-03-13 22:24:24,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:24,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:24:24,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:24,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:24:24,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:24:24,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 531 [2025-03-13 22:24:24,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 474 transitions, 1134 flow. Second operand has 5 states, 5 states have (on average 500.0) internal successors, (2500), 5 states have internal predecessors, (2500), 0 states have call successors, (0), 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-13 22:24:24,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:24,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 531 [2025-03-13 22:24:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:24,505 INFO L124 PetriNetUnfolderBase]: 104/2564 cut-off events. [2025-03-13 22:24:24,505 INFO L125 PetriNetUnfolderBase]: For 160/163 co-relation queries the response was YES. [2025-03-13 22:24:24,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 2564 events. 104/2564 cut-off events. For 160/163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14639 event pairs, 18 based on Foata normal form. 5/2355 useless extension candidates. Maximal degree in co-relation 2978. Up to 78 conditions per place. [2025-03-13 22:24:24,513 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 17 selfloop transitions, 12 changer transitions 0/483 dead transitions. [2025-03-13 22:24:24,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 483 transitions, 1218 flow [2025-03-13 22:24:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:24:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:24:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3014 transitions. [2025-03-13 22:24:24,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460138104205901 [2025-03-13 22:24:24,517 INFO L175 Difference]: Start difference. First operand has 474 places, 474 transitions, 1134 flow. Second operand 6 states and 3014 transitions. [2025-03-13 22:24:24,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 483 transitions, 1218 flow [2025-03-13 22:24:24,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 483 transitions, 1209 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:24,523 INFO L231 Difference]: Finished difference. Result has 481 places, 478 transitions, 1191 flow [2025-03-13 22:24:24,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1191, PETRI_PLACES=481, PETRI_TRANSITIONS=478} [2025-03-13 22:24:24,523 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -9 predicate places. [2025-03-13 22:24:24,523 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 478 transitions, 1191 flow [2025-03-13 22:24:24,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 500.0) internal successors, (2500), 5 states have internal predecessors, (2500), 0 states have call successors, (0), 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-13 22:24:24,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:24,524 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] [2025-03-13 22:24:24,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:24:24,524 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:24,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:24,525 INFO L85 PathProgramCache]: Analyzing trace with hash 760735023, now seen corresponding path program 1 times [2025-03-13 22:24:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:24,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350231007] [2025-03-13 22:24:24,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:24,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:24,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-13 22:24:24,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-13 22:24:24,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:24,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:24,573 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-13 22:24:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350231007] [2025-03-13 22:24:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350231007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:24,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:24,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:24,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535327239] [2025-03-13 22:24:24,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:24,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:24,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:24,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:24,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 531 [2025-03-13 22:24:24,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 478 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 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-13 22:24:24,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:24,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 531 [2025-03-13 22:24:24,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:24,812 INFO L124 PetriNetUnfolderBase]: 64/2292 cut-off events. [2025-03-13 22:24:24,813 INFO L125 PetriNetUnfolderBase]: For 119/125 co-relation queries the response was YES. [2025-03-13 22:24:24,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 2292 events. 64/2292 cut-off events. For 119/125 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 11861 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2693. Up to 99 conditions per place. [2025-03-13 22:24:24,819 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 11 selfloop transitions, 2 changer transitions 0/477 dead transitions. [2025-03-13 22:24:24,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 477 transitions, 1215 flow [2025-03-13 22:24:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2025-03-13 22:24:24,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485247959824231 [2025-03-13 22:24:24,822 INFO L175 Difference]: Start difference. First operand has 481 places, 478 transitions, 1191 flow. Second operand 3 states and 1511 transitions. [2025-03-13 22:24:24,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 477 transitions, 1215 flow [2025-03-13 22:24:24,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 477 transitions, 1206 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:24,828 INFO L231 Difference]: Finished difference. Result has 481 places, 477 transitions, 1184 flow [2025-03-13 22:24:24,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=481, PETRI_TRANSITIONS=477} [2025-03-13 22:24:24,829 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -9 predicate places. [2025-03-13 22:24:24,829 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 477 transitions, 1184 flow [2025-03-13 22:24:24,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 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-13 22:24:24,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:24,830 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] [2025-03-13 22:24:24,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:24:24,830 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:24,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -567309789, now seen corresponding path program 1 times [2025-03-13 22:24:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155926714] [2025-03-13 22:24:24,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:24,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-13 22:24:24,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-13 22:24:24,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:24,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:25,283 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-13 22:24:25,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155926714] [2025-03-13 22:24:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155926714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:25,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:25,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955375875] [2025-03-13 22:24:25,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:25,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:24:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:25,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:24:25,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:24:25,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 531 [2025-03-13 22:24:25,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 477 transitions, 1184 flow. Second operand has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 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-13 22:24:25,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:25,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 531 [2025-03-13 22:24:25,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:25,973 INFO L124 PetriNetUnfolderBase]: 258/3166 cut-off events. [2025-03-13 22:24:25,974 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-13 22:24:25,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 3166 events. 258/3166 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 20355 event pairs, 164 based on Foata normal form. 0/2916 useless extension candidates. Maximal degree in co-relation 4221. Up to 654 conditions per place. [2025-03-13 22:24:25,991 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 60 selfloop transitions, 5 changer transitions 0/476 dead transitions. [2025-03-13 22:24:25,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 476 transitions, 1312 flow [2025-03-13 22:24:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:24:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:24:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2768 transitions. [2025-03-13 22:24:26,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8688010043942247 [2025-03-13 22:24:26,000 INFO L175 Difference]: Start difference. First operand has 481 places, 477 transitions, 1184 flow. Second operand 6 states and 2768 transitions. [2025-03-13 22:24:26,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 476 transitions, 1312 flow [2025-03-13 22:24:26,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 476 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:26,009 INFO L231 Difference]: Finished difference. Result has 483 places, 476 transitions, 1188 flow [2025-03-13 22:24:26,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1188, PETRI_PLACES=483, PETRI_TRANSITIONS=476} [2025-03-13 22:24:26,010 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -7 predicate places. [2025-03-13 22:24:26,010 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 476 transitions, 1188 flow [2025-03-13 22:24:26,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 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-13 22:24:26,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:26,011 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] [2025-03-13 22:24:26,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:24:26,012 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1342732147, now seen corresponding path program 1 times [2025-03-13 22:24:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94509818] [2025-03-13 22:24:26,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:26,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:26,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-13 22:24:26,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-13 22:24:26,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:26,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:26,057 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-13 22:24:26,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:26,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94509818] [2025-03-13 22:24:26,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94509818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:26,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:26,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:26,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429573501] [2025-03-13 22:24:26,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:26,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:26,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:26,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:26,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:26,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 531 [2025-03-13 22:24:26,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 476 transitions, 1188 flow. Second operand has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 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-13 22:24:26,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:26,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 531 [2025-03-13 22:24:26,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:26,288 INFO L124 PetriNetUnfolderBase]: 64/2277 cut-off events. [2025-03-13 22:24:26,289 INFO L125 PetriNetUnfolderBase]: For 96/102 co-relation queries the response was YES. [2025-03-13 22:24:26,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 2277 events. 64/2277 cut-off events. For 96/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 11730 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2685. Up to 99 conditions per place. [2025-03-13 22:24:26,296 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 11 selfloop transitions, 2 changer transitions 0/475 dead transitions. [2025-03-13 22:24:26,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 475 transitions, 1212 flow [2025-03-13 22:24:26,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2025-03-13 22:24:26,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485247959824231 [2025-03-13 22:24:26,298 INFO L175 Difference]: Start difference. First operand has 483 places, 476 transitions, 1188 flow. Second operand 3 states and 1511 transitions. [2025-03-13 22:24:26,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 475 transitions, 1212 flow [2025-03-13 22:24:26,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 475 transitions, 1202 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:24:26,304 INFO L231 Difference]: Finished difference. Result has 479 places, 475 transitions, 1180 flow [2025-03-13 22:24:26,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1180, PETRI_PLACES=479, PETRI_TRANSITIONS=475} [2025-03-13 22:24:26,305 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -11 predicate places. [2025-03-13 22:24:26,305 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 475 transitions, 1180 flow [2025-03-13 22:24:26,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 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-13 22:24:26,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:26,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:24:26,306 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:26,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash -33073907, now seen corresponding path program 1 times [2025-03-13 22:24:26,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:26,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121057783] [2025-03-13 22:24:26,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:26,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-13 22:24:26,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-13 22:24:26,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:26,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:26,342 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-13 22:24:26,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:26,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121057783] [2025-03-13 22:24:26,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121057783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:26,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:26,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:26,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012625321] [2025-03-13 22:24:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:26,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:26,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:26,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:26,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-13 22:24:26,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 475 transitions, 1180 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 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-13 22:24:26,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:26,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-13 22:24:26,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:26,590 INFO L124 PetriNetUnfolderBase]: 64/2235 cut-off events. [2025-03-13 22:24:26,591 INFO L125 PetriNetUnfolderBase]: For 96/102 co-relation queries the response was YES. [2025-03-13 22:24:26,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2235 events. 64/2235 cut-off events. For 96/102 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 11354 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2654. Up to 84 conditions per place. [2025-03-13 22:24:26,597 INFO L140 encePairwiseOnDemand]: 526/531 looper letters, 12 selfloop transitions, 1 changer transitions 0/471 dead transitions. [2025-03-13 22:24:26,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 471 transitions, 1198 flow [2025-03-13 22:24:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2025-03-13 22:24:26,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466415568110483 [2025-03-13 22:24:26,600 INFO L175 Difference]: Start difference. First operand has 479 places, 475 transitions, 1180 flow. Second operand 3 states and 1508 transitions. [2025-03-13 22:24:26,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 471 transitions, 1198 flow [2025-03-13 22:24:26,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:26,606 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 1170 flow [2025-03-13 22:24:26,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=475, PETRI_TRANSITIONS=471} [2025-03-13 22:24:26,606 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -15 predicate places. [2025-03-13 22:24:26,607 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 1170 flow [2025-03-13 22:24:26,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 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-13 22:24:26,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:26,607 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] [2025-03-13 22:24:26,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:24:26,607 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash 943944610, now seen corresponding path program 1 times [2025-03-13 22:24:26,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:26,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420609648] [2025-03-13 22:24:26,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:26,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-13 22:24:26,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-13 22:24:26,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:26,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:24:26,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:26,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420609648] [2025-03-13 22:24:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420609648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:26,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714815760] [2025-03-13 22:24:26,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:26,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:24:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:26,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:24:26,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:24:27,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 531 [2025-03-13 22:24:27,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 471 transitions, 1170 flow. Second operand has 6 states, 6 states have (on average 477.8333333333333) internal successors, (2867), 6 states have internal predecessors, (2867), 0 states have call successors, (0), 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-13 22:24:27,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 531 [2025-03-13 22:24:27,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,759 INFO L124 PetriNetUnfolderBase]: 242/3490 cut-off events. [2025-03-13 22:24:27,759 INFO L125 PetriNetUnfolderBase]: For 192/193 co-relation queries the response was YES. [2025-03-13 22:24:27,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 3490 events. 242/3490 cut-off events. For 192/193 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 23017 event pairs, 82 based on Foata normal form. 0/3257 useless extension candidates. Maximal degree in co-relation 4418. Up to 402 conditions per place. [2025-03-13 22:24:27,772 INFO L140 encePairwiseOnDemand]: 520/531 looper letters, 44 selfloop transitions, 22 changer transitions 0/496 dead transitions. [2025-03-13 22:24:27,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 496 transitions, 1356 flow [2025-03-13 22:24:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:24:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:24:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2915 transitions. [2025-03-13 22:24:27,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9149403640929065 [2025-03-13 22:24:27,777 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 1170 flow. Second operand 6 states and 2915 transitions. [2025-03-13 22:24:27,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 496 transitions, 1356 flow [2025-03-13 22:24:27,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 496 transitions, 1355 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:27,787 INFO L231 Difference]: Finished difference. Result has 484 places, 492 transitions, 1319 flow [2025-03-13 22:24:27,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1319, PETRI_PLACES=484, PETRI_TRANSITIONS=492} [2025-03-13 22:24:27,788 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -6 predicate places. [2025-03-13 22:24:27,788 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 492 transitions, 1319 flow [2025-03-13 22:24:27,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 477.8333333333333) internal successors, (2867), 6 states have internal predecessors, (2867), 0 states have call successors, (0), 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-13 22:24:27,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:27,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:24:27,789 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:27,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1245408483, now seen corresponding path program 1 times [2025-03-13 22:24:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913822767] [2025-03-13 22:24:27,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-13 22:24:27,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-13 22:24:27,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,837 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-13 22:24:27,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913822767] [2025-03-13 22:24:27,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913822767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628361342] [2025-03-13 22:24:27,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:27,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-03-13 22:24:27,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 492 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 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-13 22:24:27,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:27,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-03-13 22:24:27,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:28,134 INFO L124 PetriNetUnfolderBase]: 128/2803 cut-off events. [2025-03-13 22:24:28,134 INFO L125 PetriNetUnfolderBase]: For 128/137 co-relation queries the response was YES. [2025-03-13 22:24:28,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 2803 events. 128/2803 cut-off events. For 128/137 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 16263 event pairs, 4 based on Foata normal form. 0/2688 useless extension candidates. Maximal degree in co-relation 3457. Up to 105 conditions per place. [2025-03-13 22:24:28,146 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 12 selfloop transitions, 3 changer transitions 0/490 dead transitions. [2025-03-13 22:24:28,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 490 transitions, 1345 flow [2025-03-13 22:24:28,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1510 transitions. [2025-03-13 22:24:28,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478970495919649 [2025-03-13 22:24:28,174 INFO L175 Difference]: Start difference. First operand has 484 places, 492 transitions, 1319 flow. Second operand 3 states and 1510 transitions. [2025-03-13 22:24:28,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 490 transitions, 1345 flow [2025-03-13 22:24:28,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 490 transitions, 1345 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:28,183 INFO L231 Difference]: Finished difference. Result has 483 places, 490 transitions, 1328 flow [2025-03-13 22:24:28,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=483, PETRI_TRANSITIONS=490} [2025-03-13 22:24:28,185 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -7 predicate places. [2025-03-13 22:24:28,185 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 490 transitions, 1328 flow [2025-03-13 22:24:28,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 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-13 22:24:28,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:28,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:28,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:24:28,186 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:28,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash -409403743, now seen corresponding path program 1 times [2025-03-13 22:24:28,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:28,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800329383] [2025-03-13 22:24:28,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:28,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-13 22:24:28,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-13 22:24:28,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:28,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:24:28,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:28,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800329383] [2025-03-13 22:24:28,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800329383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:28,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:28,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:28,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589367613] [2025-03-13 22:24:28,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:28,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:24:28,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:28,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:24:28,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:24:28,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 531 [2025-03-13 22:24:28,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 490 transitions, 1328 flow. Second operand has 6 states, 6 states have (on average 456.6666666666667) internal successors, (2740), 6 states have internal predecessors, (2740), 0 states have call successors, (0), 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-13 22:24:28,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:28,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 531 [2025-03-13 22:24:28,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:29,519 INFO L124 PetriNetUnfolderBase]: 575/4337 cut-off events. [2025-03-13 22:24:29,519 INFO L125 PetriNetUnfolderBase]: For 590/615 co-relation queries the response was YES. [2025-03-13 22:24:29,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6741 conditions, 4337 events. 575/4337 cut-off events. For 590/615 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 30640 event pairs, 232 based on Foata normal form. 4/4107 useless extension candidates. Maximal degree in co-relation 6684. Up to 1126 conditions per place. [2025-03-13 22:24:29,544 INFO L140 encePairwiseOnDemand]: 512/531 looper letters, 85 selfloop transitions, 55 changer transitions 0/547 dead transitions. [2025-03-13 22:24:29,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 547 transitions, 1758 flow [2025-03-13 22:24:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:24:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:24:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2837 transitions. [2025-03-13 22:24:29,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8904582548650345 [2025-03-13 22:24:29,550 INFO L175 Difference]: Start difference. First operand has 483 places, 490 transitions, 1328 flow. Second operand 6 states and 2837 transitions. [2025-03-13 22:24:29,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 547 transitions, 1758 flow [2025-03-13 22:24:29,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 547 transitions, 1758 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:29,561 INFO L231 Difference]: Finished difference. Result has 493 places, 543 transitions, 1722 flow [2025-03-13 22:24:29,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1722, PETRI_PLACES=493, PETRI_TRANSITIONS=543} [2025-03-13 22:24:29,562 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, 3 predicate places. [2025-03-13 22:24:29,562 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 543 transitions, 1722 flow [2025-03-13 22:24:29,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 456.6666666666667) internal successors, (2740), 6 states have internal predecessors, (2740), 0 states have call successors, (0), 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-13 22:24:29,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:29,563 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] [2025-03-13 22:24:29,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:24:29,563 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-03-13 22:24:29,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1704564917, now seen corresponding path program 1 times [2025-03-13 22:24:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:29,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777149776] [2025-03-13 22:24:29,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:29,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-13 22:24:29,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-13 22:24:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:29,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat